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: "numeration systems on a regular language"
  Abstract: Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable. We also study the translation and the multiplication by constants as well as the order dependence of the recognizability.

Connected through hyperedge HE-1 (induced by source paper "on subtrees of the representation tree in rational base numeration systems"):
  with members:
    - "auto similarity in rational base number systems"

Connected through hyperedge HE-2 (induced by source paper "breadth first serialisation of trees and rational languages"):
  with members:
    - "rhythmic generation of infinite trees and languages"

Connected through hyperedge HE-3 (induced by source paper "ultimate periodicity of b recognisable sets a quasilinear procedure"):
  with members:
    - "periodicity repetitions and orbits of an automatic sequence"
    - "least significant digit first presburger automata"

Connected through hyperedge HE-4 (induced by source paper "text compression using abstract numeration system on a regular language"):
  with members:
    - "combinatorial characterization of formal languages"

Connected through hyperedge HE-5 (induced by source paper "numeration systems a link between number theory and formal language theory"):
  with members:
    - "state complexity of testing divisibility"
    - "state complexity of testing divisibility"
    - "a note on syndeticity recognizable sets and cobham s theorem"
    - "multidimensional generalized automatic sequences and shape symmetric morphic words"
    - "abstract numeration systems on bounded languages and multiplication by a constant"
    - "minimal dfa for testing divisibility"

Connected through hyperedge HE-6 (induced by source paper "on the enumerating series of an abstract numeration system"):
  with members:
    - "state complexity of testing divisibility"
    - "state complexity of testing divisibility"
    - "on the decomposition of k valued rational relations"
    - "numeration systems on a regular language arithmetic operations recognizability and formal power series"

Connected through hyperedge HE-7 (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"
    - "generalization of automatic sequences for numeration systems on a regular language"
    - "construction of regular languages and recognizability of polynomials"

Connected through hyperedge HE-8 (induced by source paper "state complexity of testing divisibility"):
  with members:
    - "a decision problem for ultimately periodic sets in non standard numeration systems"
    - "periodicity repetitions and orbits of an automatic sequence"
    - "minimal dfa for testing divisibility"
    - "real numbers having ultimately periodic representations in abstract numeration systems"

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.OH(Other Computer Science)