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 "an extremal series of eulerian synchronizing automata"):
  Abstract: We present an infinite series of n-state Eulerian automata whose reset words have length at least $$n^2-3/2$$. This improves the current lower bound on the length of shortest reset words in Eulerian automata. We conjecture that $$n^2-3/2$$ also forms an upper bound for this class and we experimentally verify it for small automata by an exhaustive computation.

Includes members:
  Member "experiments with synchronizing automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a linear bound on the k rendezvous time for primitive sets of nz matrices")
  Member "synchronizing automata with extremal properties":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a linear bound on the k rendezvous time for primitive sets of nz matrices")
  Member "algebraic synchronization criterion and computing reset words":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cerny starke conjecture from the sixties of xx century")
  Member "reset thresholds of automata with two cycle lengths":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the number of synchronizing colorings of digraphs")
  Member "generating synchronizing automata with large reset lengths":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "experiments with synchronizing automata")
  Member "strong inapproximability of the shortest reset word":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a linear bound on the k rendezvous time for primitive sets of nz matrices")
  Member "primitive digraphs with large exponents and slowly synchronizing automata":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal synchronization of partial deterministic finite automata")
  Member "slowly synchronizing automata and digraphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cerny starke conjecture from the sixties of xx century")

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)