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: "on the number of unbordered factors"
  Abstract: We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We show that f(n)  = 4 and that f(n) = n infinitely often. We also give examples of automatic sequences having exactly 2 unbordered factors of every length.

Connected through hyperedge HE-1 (induced by source paper "abelian square rich words"):
  with members:
    - "maximum number of distinct and nonequivalent nonstandard squares in a word"
    - "words with the maximum number of abelian squares"
    - "cyclic complexity of words"
    - "decision algorithms for fibonacci automatic words with applications to pattern avoidance"
    - "abelian repetitions in sturmian words"
    - "enumeration and decidable properties of automatic sequences"
    - "periodicity repetitions and orbits of an automatic sequence"

Connected through hyperedge HE-2 (induced by source paper "sums of palindromes an approach via automata"):
  with members:
    - "primitive words and lyndon words in automatic and linearly recurrent sequences"
    - "enumeration and decidable properties of automatic sequences"
    - "periodicity repetitions and orbits of an automatic sequence"

Connected through hyperedge HE-3 (induced by source paper "closed palindromic rich privileged trapezoidal and balanced words in automatic sequences"):
  with members:
    - "remarks on privileged words"
    - "on the number of closed factors in a word"
    - "enumeration and structure of trapezoidal words"
    - "subword complexity and k synchronization"
    - "enumeration and decidable properties of automatic sequences"

Connected through hyperedge HE-4 (induced by source paper "mechanical proofs of properties of the tribonacci word"):
  with members:
    - "decision algorithms for fibonacci automatic words with applications to pattern avoidance"
    - "primitive words and lyndon words in automatic and linearly recurrent sequences"
    - "subword complexity and k synchronization"
    - "enumeration and decidable properties of automatic sequences"
    - "periodicity repetitions and orbits of an automatic sequence"

Connected through hyperedge HE-5 (induced by source paper "decision algorithms for fibonacci automatic words with applications to pattern avoidance"):
  with members:
    - "primitive words and lyndon words in automatic and linearly recurrent sequences"
    - "enumeration and decidable properties of automatic sequences"
    - "pattern avoidability with involution"
    - "avoiding three consecutive blocks of the same size and same sum"
    - "periodicity repetitions and orbits of an automatic sequence"

Connected through hyperedge HE-6 (induced by source paper "subword complexity and k synchronization"):
  with members:
    - "enumeration and decidable properties of automatic sequences"
    - "the critical exponent is computable for automatic sequences"

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)