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: "determinising parity automata"
  Abstract: Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the intermediate determinisation to Rabin automata is optimal. We show that the resulting determinisation to parity automata is optimal up to a small constant. Moreover, the lower bound refers to the more liberal Streett acceptance. We thus show that determinisation to Streett would not lead to better bounds than determinisation to parity. As a side-result, this optimality extends to the determinisation of Buchi automata.

Connected through hyperedge HE-1 (induced by source paper "on succinctness and recognisability of alternating good for games automata"):
  with members:
    - "good for games automata from nondeterminism to alternation"
    - "computing the width of non deterministic automata"
    - "how deterministic are good for games automata"
    - "can nondeterminism help complementation"

Connected through hyperedge HE-2 (induced by source paper "good for mdps automata for probabilistic analysis and reinforcement learning"):
  with members:
    - "omega regular objectives in model free reinforcement learning"
    - "proximal policy optimization algorithms"
    - "adam a method for stochastic optimization"
    - "state of buchi complementation"
    - "lazy probabilistic model checking without determinisation"

Connected through hyperedge HE-3 (induced by source paper "permutation games for the weakly aconjunctive mu calculus"):
  with members:
    - "buchi determinization made tighter"
    - "the fixpoint iteration algorithm for parity games"
    - "exptime tableaux for the coalgebraic mu calculus"

Connected through hyperedge HE-4 (induced by source paper "tight bounds for complementing parity automata"):
  with members:
    - "a tight lower bound for streett complementation"
    - "tight upper bounds for streett and parity complementation"
    - "b uchi complementation made tight"
    - "lower bounds for complementation of omega automata via the full automata technique"

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)