human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "alternating tree automata with qualitative semantics"):
  Abstract: We study alternating automata with qualitative semantics over infinite binary trees: alternation means that two opposing players construct a decoration of the input tree called a run, and the qualitative semantics says that a run of the automaton is accepting if almost all branches of the run are accepting. In this paper we prove a positive and a negative result for the emptiness problem of alternating automata with qualitative semantics. #R##N#The positive result is the decidability of the emptiness problem for the case of Buchi acceptance condition. An interesting aspect of our approach is that we do not extend the classical solution for solving the emptiness problem of alternating automata, which first constructs an equivalent non-deterministic automaton. Instead, we directly construct an emptiness game making use of imperfect information. #R##N#The negative result is the undecidability of the emptiness problem for the case of co-Buchi acceptance condition. This result has two direct consequences: the undecidability of monadic second-order logic extended with the qualitative path-measure quantifier, and the undecidability of the emptiness problem for alternating tree automata with non-zero semantics, a recently introduced probabilistic model of alternating tree automata.

Includes members:
  Member "monadic second order logic with path measure quantifier is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mso nabla is undecidable")
  Member "alternating nonzero automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "monadic second order logic with path measure quantifier is undecidable")
  Member "emptiness of zero automata is decidable":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "monadic second order logic with path measure quantifier is undecidable")
  Member "monadic second order logic with measure and category quantifiers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "monadic second order logic with path measure quantifier is undecidable")
  Member "pure strategies in imperfect information stochastic games":
    also connected through other hyperedges:
      (none)
  Member "partial observation stochastic games how to win when belief fails":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "strategy logic with imperfect information")
  Member "qualitative concurrent stochastic games with imperfect information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pure strategies in imperfect information stochastic games")
  Member "algorithms for omega regular games with imperfect information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "how good is a strategy in a game with nature")

Question: Please tell me which class the source paper 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)