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: "effective translation of ltl to deterministic rabin automata beyond the f g fragment"
  Abstract: Some applications of linear temporal logic (LTL) require to translate formulae of the logic to deterministic omega-automata. There are currently two translators producing deterministic automata: ltl2dstar working for the whole LTL and Rabinizer applicable to LTL(F,G) which is the LTL fragment using only modalities F and G. We present a new translation to deterministic Rabin automata via alternating automata and deterministic transition-based generalized Rabin automata. Our translation applies to a fragment that is strictly larger than LTL(F,G). Experimental results show that our algorithm can produce significantly smaller automata compared to Rabinizer and ltl2dstar, especially for more complex LTL formulae.

Connected through hyperedge HE-1 (induced by source paper "ltl to smaller self loop alternating automata and back"):
  with members:
    - "ltl to deterministic emerson lei automata"
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"
    - "truly on the fly ltl model checking"

Connected through hyperedge HE-2 (induced by source paper "one theorem to rule them all a unified translation of ltl into ω automata"):
  with members:
    - "index appearance record for transforming rabin automata into parity automata"
    - "from ltl and limit deterministic b uchi automata to deterministic parity automata"
    - "from ltl to deterministic automata a safraless compositional approach"
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"
    - "lazy probabilistic model checking without determinisation"
    - "deterministic automata for the f g fragment of ltl"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Connected through hyperedge HE-3 (induced by source paper "index appearance record for transforming rabin automata into parity automata"):
  with members:
    - "from ltl to deterministic automata a safraless compositional approach"
    - "deterministic automata for the f g fragment of ltl"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Connected through hyperedge HE-4 (induced by source paper "from ltl to deterministic automata a safraless compositional approach"):
  with members:
    - "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis"
    - "deterministic automata for the f g fragment of ltl"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

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)