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: "decidable problems for probabilistic automata on infinite words"
  Abstract: We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether for every epsilon > 0 there is a word that is accepted with probability at least 1 - epsilon. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape (regular) words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions. For most decidable problems we show an optimal PSPACE-complete complexity bound.

Connected through hyperedge HE-1 (induced by source paper "the complexity of pomdps with long run average objectives"):
  with members:
    - "power of randomization in automata on infinite strings"
    - "reinforcement learning a survey"

Connected through hyperedge HE-2 (induced by source paper "distribution based objectives for markov decision processes"):
  with members:
    - "controlling a population"
    - "on the polytope escape problem for continuous linear dynamical systems"
    - "robust synchronization in markov decision processes"
    - "ultimate positivity is decidable for simple linear recurrence sequences"
    - "infinite synchronizing words for probabilistic automata erratum"

Connected through hyperedge HE-3 (induced by source paper "profinite techniques for probabilistic automata and the markov monoid algorithm"):
  with members:
    - "deciding the value 1 problem for probabilistic leaktight automata"

Connected through hyperedge HE-4 (induced by source paper "deciding maxmin reachability in half blind stochastic games"):
  with members:
    - "profinite techniques for probabilistic automata and the optimality of the markov monoid algorithm"
    - "deciding the value 1 problem for probabilistic leaktight automata"
    - "the complexity of partial observation stochastic parity games with finite memory strategies"
    - "regular cost functions part i logic and algebra over words"
    - "power of randomization in automata on infinite strings"
    - "partial observation stochastic games how to win when belief fails"

Connected through hyperedge HE-5 (induced by source paper "deciding the value 1 problem for probabilistic leaktight automata"):
  with members:
    - "what is known about the value 1 problem for probabilistic automata"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-6 (induced by source paper "qualitative analysis of concurrent mean payoff games"):
  with members:
    - "the complexity of partial observation stochastic parity games with finite memory strategies"
    - "the value 1 problem under finite memory strategies for concurrent mean payoff games"
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "synthesis from ltl specifications with mean payoff objectives"
    - "partial observation stochastic games how to win when belief fails"
    - "qualitative reachability in stochastic bpa games"
    - "measuring and synthesizing systems in probabilistic environments"
    - "the complexity of solving reachability games using value and strategy iteration"

Connected through hyperedge HE-7 (induced by source paper "cegar for qualitative analysis of probabilistic systems"):
  with members:
    - "the complexity of partial observation stochastic parity games with finite memory strategies"
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "interface simulation distances"
    - "assume guarantee abstraction refinement for probabilistic systems"
    - "faster algorithms for alternating refinement relations"
    - "an o n 2 time algorithm for alternating b uchi games"
    - "partial observation stochastic games how to win when belief fails"
    - "qualitative analysis of partially observable markov decision processes"

Connected through hyperedge HE-8 (induced by source paper "the value 1 problem under finite memory strategies for concurrent mean payoff games"):
  with members:
    - "qualitative analysis of concurrent mean payoff games"
    - "the complexity of solving reachability games using value and strategy iteration"
    - "one counter markov decision processes"
    - "recursive concurrent stochastic games"
    - "stochastic limit average games are in exptime"

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)