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: "ltl to deterministic emerson lei automata"
  Abstract: We introduce a new translation from linear temporal logic (LTL) to deterministic Emerson-Lei automata, which are omega-automata with a Muller acceptance condition symbolically expressed as a Boolean formula. The richer acceptance condition structure allows the shift of complexity from the state space to the acceptance condition. Conceptually the construction is an enhanced product construction that exploits knowledge of its components to reduce the number of states. We identify two fragments of LTL, for which one can easily construct deterministic automata and show how knowledge of these components can reduce the number of states. We extend this idea to a general LTL framework, where we can use arbitrary LTL to deterministic automata translators for parts of formulas outside the mentioned fragments. Further, we show succinctness of the translation compared to existing construction. The construction is implemented in the tool Delag, which we evaluate on several benchmarks of LTL formulas and probabilistic model checking case studies.

Connected through hyperedge HE-1 (induced by source paper "practical synthesis of reactive systems from ltl specifications via parity games"):
  with members:
    - "the 5th reactive synthesis competition syntcomp 2018 benchmarks participants results"
    - "bosy an experimentation framework for bounded synthesis"
    - "bounded synthesis of reactive programs"
    - "one theorem to rule them all a unified translation of ltl into ω automata"
    - "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results"
    - "from ltl and limit deterministic b uchi automata to deterministic parity automata"
    - "synthesizing functional reactive programs"
    - "the 3rd reactive synthesis competition syntcomp 2016 benchmarks participants results"

Connected through hyperedge HE-2 (induced by source paper "ltl to smaller self loop alternating automata and back"):
  with members:
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"
    - "effective translation of ltl to deterministic rabin automata beyond the f g fragment"
    - "truly on the fly ltl model checking"

Connected through hyperedge HE-3 (induced by source paper "from ltl to unambiguous b uchi automata via disambiguation of alternating automata"):
  with members:
    - "ltl store repository of ltl formulae from literature and case studies"
    - "lazy probabilistic model checking without determinisation"

Connected through hyperedge HE-4 (induced by source paper "new optimizations and heuristics for determinization of b uchi automata"):
  with members:
    - "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results"
    - "profile trees for buchi word automata with application to determinization"

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)