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 "tight bounds for complementing parity automata"):
  Abstract: We follow a connection between tight determinisation and complementation and establish a complementation procedure from transition labelled parity automata to transition labelled nondeterministic Buchi automata. We prove it to be tight up to an O(n) factor, where n is the size of the nondeterministic parity automaton. This factor does not depend on the number of priorities.

Includes members:
  Member "determinising parity automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on succinctness and recognisability of alternating good for games automata")
  Member "a tight lower bound for streett complementation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "can nondeterminism help complementation")
  Member "tight upper bounds for streett and parity complementation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "determinising parity automata")
  Member "b uchi complementation made tight":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "state of buchi complementation")
  Member "lower bounds for complementation of omega automata via the full automata technique":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "alternating weak automata from universal trees")

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)