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: "multidimensional generalized automatic sequences and shape symmetric morphic words"
  Abstract: An infinite word is S-automatic if, for all n>=0, its (n + 1)st letter is the output of a deterministic automaton fed with the representation of n in the considered numeration system S. In this extended abstract, we consider an analogous definition in a multidimensional setting and present the connection to the shape-symmetric infinite words introduced by Arnaud Maes. More precisely, for d>=2, we state that a multidimensional infinite word x : N^d \to \Sigma over a finite alphabet \Sigma is S-automatic for some abstract numeration system S built on a regular language containing the empty word if and only if x is the image by a coding of a shape-symmetric infinite word.

Connected through hyperedge HE-1 (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"
    - "abstract numeration systems on bounded languages and multiplication by a constant"
    - "minimal dfa for testing divisibility"
    - "numeration systems on a regular language"

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"
    - "abstract numeration systems on bounded languages and multiplication by a constant"
    - "generalization of automatic sequences for numeration systems on a regular language"
    - "numeration systems on a regular language"
    - "construction of regular languages and recognizability of polynomials"

Connected through hyperedge HE-3 (induced by source paper "multi dimensional sets recognizable in all abstract numeration systems"):
  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.FL(Formal Languages and Automata Theory)