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: "emptiness of zero automata is decidable"
  Abstract: Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the emptiness problem for zero automata. We introduce a variant of zero automata called nonzero automata. We prove that for every zero automaton there is an equivalent nonzero automaton of quadratic size and the emptiness problem of nonzero automata is decidable and both in NP and in coNP. These results imply that tmso + zero has decidable satisfiability.

Connected through hyperedge HE-1 (induced by source paper "alternating tree automata with qualitative semantics"):
  with members:
    - "monadic second order logic with path measure quantifier is undecidable"
    - "alternating nonzero automata"
    - "monadic second order logic with measure and category quantifiers"
    - "pure strategies in imperfect information stochastic games"
    - "partial observation stochastic games how to win when belief fails"
    - "qualitative concurrent stochastic games with imperfect information"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-2 (induced by source paper "monadic second order logic with path measure quantifier is undecidable"):
  with members:
    - "mso nabla is undecidable"
    - "alternating nonzero automata"
    - "monadic second order logic with measure and category quantifiers"

Connected through hyperedge HE-3 (induced by source paper "mso nabla is undecidable"):
  with members:
    - "monadic second order logic with path measure quantifier is undecidable"
    - "threshold constraints with guarantees for parity objectives in markov decision processes"
    - "the mso u theory of n is undecidable"

Connected through hyperedge HE-4 (induced by source paper "monadic second order logic with measure and category quantifiers"):
  with members:
    - "how good is a strategy in a game with nature"
    - "the mso u theory of n is undecidable"
    - "on the problem of computing the probability of regular sets of trees"

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)