human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "weak mso with the unbounding quantifier"
  Abstract: A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter automaton), and in terms of logic (weak monadic second-order logic with a bounding quantifier). Effective translations between the logic and automata are given.

Connected through hyperedge HE-1 (induced by source paper "recursion schemes the mso logic and the u quantifier"):
  with members:
    - "the diagonal problem for higher order recursion schemes is decidable"
    - "unboundedness and downward closures of higher order pushdown automata"
    - "ordered tree pushdown systems"
    - "an approach to computing downward closures"
    - "using models to model check recursive schemes"
    - "weak mso u with path quantifiers over infinite trees"
    - "io vs oi in higher order recursion schemes"

Connected through hyperedge HE-2 (induced by source paper "finite state strategies in delay games"):
  with members:
    - "games with costs and delays"
    - "finite state strategies in delay games full version"
    - "how much lookahead is needed to win infinite games"
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "succinct progress measures for solving parity games"
    - "extending finite memory determinacy to multiplayer games"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "delay games with wmso u winning conditions"

Connected through hyperedge HE-3 (induced by source paper "finite state strategies in delay games full version"):
  with members:
    - "games with costs and delays"
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "succinct progress measures for solving parity games"
    - "finite state strategies in delay games"
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "extending finite memory determinacy to multiplayer games"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "delay games with wmso u winning conditions"

Connected through hyperedge HE-4 (induced by source paper "games with costs and delays"):
  with members:
    - "how much lookahead is needed to win infinite games"
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "delay games with wmso u winning conditions"
    - "parity and streett games with costs"
    - "degrees of lookahead in regular infinite games"
    - "optimal bounds in parametric ltl games"

Connected through hyperedge HE-5 (induced by source paper "beyond ωbs regular languages ωt regular expressions and counter check automata"):
  with members:
    - "the mso u theory of n is undecidable"
    - "separation property for wb and ws regular languages"

Connected through hyperedge HE-6 (induced by source paper "parameterized linear temporal logics meet costs still not costlier than ltl"):
  with members:
    - "approximating optimal bounds in prompt ltl realizability in doubly exponential time"
    - "visibly linear dynamic logic"
    - "parametric linear dynamic logic full version"
    - "parameterized linear temporal logics meet costs still not costlier than ltl full version"
    - "parametric linear dynamic logic"
    - "weak mso u with path quantifiers over infinite trees"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "parity and streett games with costs"

Connected through hyperedge HE-7 (induced by source paper "the mso u theory of n is undecidable"):
  with members:
    - "satisfiability of ctl with constraints"
    - "efficient controller synthesis for consumption games with multiple resource types"

Connected through hyperedge HE-8 (induced by source paper "delay games with wmso u winning conditions"):
  with members:
    - "how much lookahead is needed to win infinite games"
    - "the mso u theory of n is undecidable"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "proceedings fifth international symposium on games automata logics and formal verification"
    - "synthesis of deterministic top down tree transducers from automatic tree relations"
    - "parametric linear dynamic logic"
    - "weak mso u with path quantifiers over infinite trees"
    - "parity and streett games with costs"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.FL(Formal Languages and Automata Theory)