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: "algebraic linear orderings"
  Abstract: An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle's characterization of algebraic trees, we obtain the fact that a linear ordering is algebraic if and only if it can be represented as the lexicographic ordering of a deterministic context-free language. When the algebraic linear ordering is a well-ordering, its order type is an algebraic ordinal. We prove that the Hausdorff rank of any scattered algebraic linear ordering is less than $\omega^\omega$. It follows that the algebraic ordinals are exactly those less than $\omega^{\omega^\omega}$.

Connected through hyperedge HE-1 (induced by source paper "on the order type of scattered context free orderings"):
  with members:
    - "the ordinal generated by an ordinal grammar is computable"
    - "scattered context free linear orderings"

Connected through hyperedge HE-2 (induced by source paper "the ordinal generated by an ordinal grammar is computable"):
  with members:
    - "isomorphisms of scattered automatic linear orders"
    - "scattered context free linear orderings"
    - "isomorphism of regular trees and words"

Connected through hyperedge HE-3 (induced by source paper "isomorphism of regular trees and words"):
  with members:
    - "isomorphisms of scattered automatic linear orders"
    - "faster fully compressed pattern matching by recompression"
    - "representing small ordinals by finite automata"
    - "the isomorphism problem on classes of automatic structures"
    - "automatic structures richness and limitations"

Connected through hyperedge HE-4 (induced by source paper "on context free languages of scattered words"):
  with members:
    - "context free ordinals"
    - "scattered context free linear orderings"
    - "isomorphism of regular trees and words"

Connected through hyperedge HE-5 (induced by source paper "a note on ordinal dfas"):
  with members:
    - "scattered context free linear orderings"

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)