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: "generalization of automatic sequences for numeration systems on a regular language"
  Abstract: Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the output alphabet of the automaton. This process generalizes the concept of k-automatic sequence for abstract numeration systems on a regular language (instead of systems in base k). Here, I study the first properties of these sequences and their relations with numeration systems.

Connected through hyperedge HE-1 (induced by source paper "regularity preserving but not reflecting encodings"):
  with members:
    - "comparing computational power"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-2 (induced by source paper "the growth function of s recognizable sets"):
  with members:
    - "multi dimensional sets recognizable in all abstract numeration systems"
    - "multidimensional generalized automatic sequences and shape symmetric morphic words"
    - "abstract numeration systems on bounded languages and multiplication by a constant"
    - "numeration systems on a regular language"
    - "construction of regular languages and recognizability of polynomials"

Connected through hyperedge HE-3 (induced by source paper "multidimensional generalized automatic sequences and shape symmetric morphic words"):
  with members:
    - "numeration systems on a regular language"

Connected through hyperedge HE-4 (induced by source paper "numeration systems on a regular language arithmetic operations recognizability and formal power series"):
  with members:
    - "numeration systems on a regular language"
    - "construction of regular languages and recognizability of polynomials"

Connected through hyperedge HE-5 (induced by source paper "construction of regular languages and recognizability of polynomials"):
  with members:
    - "numeration systems on a regular language"

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.CC(Computational Complexity)