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: "degrees of lookahead in regular infinite games"
  Abstract: We study variants of regular infinite games where the strict alternation of#N#moves between the two players is subject to modifications. The second player#N#may postpone a move for a finite number of steps, or, in other words, exploit#N#in his strategy some lookahead on the moves of the opponent. This captures#N#situations in distributed systems, e.g. when buffers are present in#N#communication or when signal transmission between components is deferred. We#N#distinguish strategies with different degrees of lookahead, among them being#N#the continuous and the bounded lookahead strategies. In the first case the#N#lookahead is of finite possibly unbounded size, whereas in the second case it#N#is of bounded size. We show that for regular infinite games the solvability by#N#continuous strategies is decidable, and that a continuous strategy can always#N#be reduced to one of bounded lookahead. Moreover, this lookahead is at most#N#doubly exponential in the size of a given parity automaton recognizing the#N#winning condition. We also show that the result fails for non-regular#N#gamesxwhere the winning condition is given by a context-free omega-language.

Connected through hyperedge HE-1 (induced by source paper "on computability of data word functions defined by transducers"):
  with members:
    - "synthesis of data word transducers"
    - "deciding the computability of regular functions over infinite words"
    - "bounded synthesis of register transducers"
    - "on equivalence and uniformisation problems for finite transducers"
    - "ltl with the freeze quantifier and register automata"

Connected through hyperedge HE-2 (induced by source paper "deciding the computability of regular functions over infinite words"):
  with members:
    - "continuity and rational functions"
    - "a pattern logic for automata with outputs"
    - "one way definability of two way word transducers"

Connected through hyperedge HE-3 (induced by source paper "infinite duration bidding games"):
  with members:
    - "determinacy in discrete bidding infinite duration games"
    - "infinite duration poorman bidding games"
    - "how much lookahead is needed to win infinite games"
    - "discrete all pay bidding games"
    - "non zero sum games for reactive synthesis"
    - "pure nash equilibria in concurrent deterministic games"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"

Connected through hyperedge HE-4 (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-5 (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"
    - "optimal bounds in parametric ltl games"
    - "weak mso with the unbounding quantifier"

Connected through hyperedge HE-6 (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"
    - "buffered simulation games for buchi automata"
    - "advanced automata minimization"
    - "buchi complementation and size change termination"

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

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)