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: "extended finite automata and decision problems for matrix semigroups"
  Abstract: We make a connection between the subgroup membership and identity problems for matrix groups and extended finite automata. We provide an alternative proof for the decidability of the subgroup membership problem for $ 2 \times 2 $ integer matrices. We show that the emptiness problem for extended finite automata over $ 4 \times 4 $ integer matrix semigroups is undecidable. We prove that the decidability of the universe problem for extended finite automata is a sufficient condition for the decidability of the subgroup membership and identity problems.

Connected through hyperedge HE-1 (induced by source paper "extended models of finite automata"):
  with members:
    - "on reachability problems for low dimensional matrix semigroups"
    - "generalized results on monoids as memory"
    - "on the identity problem for the special linear group and the heisenberg group"
    - "language classes associated with automata over matrix groups"
    - "homing vector automata"
    - "silent transitions in automata with storage"
    - "real time vector automata"
    - "on the capabilities of grammars automata and transducers controlled by monoids"

Connected through hyperedge HE-2 (induced by source paper "new results on vector and homing vector automata"):
  with members:
    - "language classes associated with automata over matrix groups"
    - "affine computation and affine automaton"
    - "homing vector automata"
    - "quantum finite automata a modern introduction"
    - "real time vector automata"
    - "remarks on separating words"

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)