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: "maximally atomic languages"
  Abstract: The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known. We introduce a new class of regular languages, called the maximally atomic languages, consisting of all languages meeting these bounds. We prove the following result: If L is a regular language of quotient complexity n and G is the subgroup of permutations in the transition semigroup T of the minimal DFA of L, then L is maximally atomic if and only if G is transitive on k-subsets of 1,...,n for 0 <= k <= n and T contains a transformation of rank n-1.

Connected through hyperedge HE-1 (induced by source paper "towards a theory of complexity of regular languages"):
  with members:
    - "most complex non returning regular languages"
    - "unrestricted state complexity of binary operations on regular languages"
    - "unrestricted state complexity of binary operations on regular and ideal languages"
    - "most complex regular ideal languages"
    - "syntactic complexity of regular ideals"
    - "upper bounds on syntactic complexity of left and two sided ideals"
    - "complexity of atoms combinatorially"
    - "symmetric groups and quotient complexity of boolean operations"

Connected through hyperedge HE-2 (induced by source paper "complexity of prefix convex regular languages"):
  with members:
    - "unrestricted state complexity of binary operations on regular languages"
    - "quotient complexities of atoms in regular ideal languages"
    - "most complex regular ideal languages"
    - "syntactic complexity of regular ideals"
    - "complexity of atoms combinatorially"
    - "symmetric groups and quotient complexity of boolean operations"
    - "quotient complexities of atoms of regular languages"
    - "theory of atomata"

Connected through hyperedge HE-3 (induced by source paper "a survey on operational state complexity"):
  with members:
    - "upper bounds on syntactic complexity of left and two sided ideals"
    - "syntactic complexity of r and j trivial regular languages"
    - "most complex regular right ideal languages"
    - "the state complexity of star complement star"
    - "quotient complexity of star free languages"
    - "the magic number problem for subregular language families"
    - "nondeterministic state complexity for suffix free regular languages"
    - "quotient complexity of ideal languages"

Connected through hyperedge HE-4 (induced by source paper "quotient complexities of atoms in regular ideal languages"):
  with members:
    - "upper bounds on syntactic complexity of left and two sided ideals"
    - "quotient complexities of atoms of regular languages"
    - "theory of atomata"
    - "syntactic complexity of ideal and closed languages"
    - "quotient complexity of ideal languages"
    - "quotient complexity of regular languages"

Connected through hyperedge HE-5 (induced by source paper "complexity of atoms combinatorially"):
  with members:
    - "quotient complexities of atoms in regular ideal languages"
    - "complexity of suffix free regular languages"
    - "maximal syntactic complexity of regular languages implies maximal quotient complexities of atoms"
    - "quotient complexities of atoms of regular languages"
    - "theory of atomata"

Connected through hyperedge HE-6 (induced by source paper "symmetric groups and quotient complexity of boolean operations"):
  with members:
    - "most complex regular right ideal languages"
    - "universal witnesses for state complexity of basic operations combined with reversal"
    - "quotient complexities of atoms of regular languages"
    - "theory of atomata"
    - "quotient complexity of ideal languages"
    - "quotient complexity of regular languages"

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)