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: "buffered simulation games for buchi automata"
  Abstract: We introduce buffered simulations, a family of simulation relations that better approximate language inclusion than standard simulations. Buffered simulations are based on a two-player game in which the second player, called here Duplicator, may skip his turn and respond to a given move in a later round of the game. We consider various variants of these buffered simulations and es- tablish their decidability and exact complexity.

Connected through hyperedge HE-1 (induced by source paper "efficient reduction of nondeterministic automata with application to language inclusion testing"):
  with members:
    - "reduction of nondeterministic tree automata"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "advanced automata minimization"
    - "degrees of lookahead in regular infinite games"
    - "buchi complementation and size change termination"

Connected through hyperedge HE-2 (induced by source paper "multi buffer simulations for trace language inclusion"):
  with members:
    - "conditionally optimal algorithms for generalized buchi games"
    - "three applications to rational relations of the high undecidability of the infinite post correspondence problem in a regular omega language"
    - "advanced automata minimization"
    - "degrees of lookahead in regular infinite games"

Connected through hyperedge HE-3 (induced by source paper "two buffer simulation games"):
  with members:
    - "advanced automata minimization"

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)