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 "checking whether an automaton is monotonic is np complete"):
  Abstract: An automaton is monotonic if its states can be arranged in a linear order that is preserved by the action of every letter. We prove that the problem of deciding whether a given automaton is monotonic is NP-complete. The same result is obtained for oriented automata, whose states can be arranged in a cyclic order. Moreover, both problems remain hard under the restriction to binary input alphabets.

Includes members:
  Member "on nonpermutational transformation semigroups with an application to syntactic complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "syntactic complexity of bifix free languages")
  Member "synchronizing automata with large reset lengths":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the number of synchronizing colorings of digraphs")
  Member "large aperiodic semigroups":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "most complex deterministic union free regular languages")
  Member "experimental study of the shortest reset word of random automata":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using sat solvers for synchronization issues in non deterministic automata")
  Member "the complexity of finding reset words in finite automata":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the synchronizing probability function for primitive sets of matrices")
  Member "approximating the minimum length of synchronizing words is hard":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finding dfas with maximal shortest synchronizing word length")
  Member "decision problems for convex languages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards a theory of complexity of regular languages")

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)