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: "synthesis of deterministic top down tree transducers from automatic tree relations"
  Abstract: We consider the synthesis of deterministic tree transducers from automaton definable specifications, given as binary relations, over finite trees. We consider the case of specifications that are deterministic top-down tree automatic, meaning the specification is recognizable by a deterministic top-down tree automaton that reads the two given trees synchronously in parallel. In this setting we study tree transducers that are allowed to have either bounded delay or arbitrary delay. Delay is caused whenever the transducer reads a symbol from the input tree but does not produce output. We provide decision procedures for both bounded and arbitrary delay that yield deterministic top-down tree transducers which realize the specification for valid input trees. Similar to the case of relations over words, we use two-player games to obtain our results.

Connected through hyperedge HE-1 (induced by source paper "logics for word transductions with synthesis"):
  with members:
    - "the first reactive synthesis competition syntcomp 2014"
    - "on reversible transducers"
    - "on equivalence and uniformisation problems for finite transducers"
    - "regular combinators for string transformations"
    - "a short note on two variable logic with a linear order successor and a preorder successor"
    - "transducers with origin information"
    - "two variable logic with two order relations"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-2 (induced by source paper "how much lookahead is needed to win infinite games"):
  with members:
    - "unbounded lookahead in wmso u 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 "unbounded lookahead in wmso u games"):
  with members:
    - "the mso u theory of n is undecidable"
    - "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 "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"
    - "parametric linear dynamic logic"
    - "weak mso u with path quantifiers over infinite trees"
    - "parity and streett games with costs"
    - "degrees of lookahead in regular infinite games"

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)