human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "extended models of finite automata"):
  Abstract: Many of the numerous automaton models proposed in the literature can be regarded as a finite automaton equipped with an additional storage mechanism. In this thesis, we focus on two such models, namely the finite automata over groups and the homing vector automata. #R##N#A finite automaton over a group $ G $ is a nondeterministic finite automaton equipped with a register that holds an element of the group $ G $. The register is initialized to the identity element of the group and a computation is successful if the register is equal to the identity element at the end of the computation after being multiplied with a group element at every step. We investigate the language recognition power of finite automata over integer and rational matrix groups and reveal new relationships between the language classes corresponding to these models. We examine the effect of various parameters on the language recognition power. We establish a link between the decision problems of matrix semigroups and the corresponding automata. We present some new results about valence pushdown automata and context-free valence grammars. #R##N#We also propose the new homing vector automaton model, which is a finite automaton equipped with a vector that can be multiplied with a matrix at each step. The vector can be checked for equivalence to the initial vector and the acceptance criterion is ending up in an accept state with the value of the vector being equal to the initial vector. We examine the effect of various restrictions on the model by confining the matrices to a particular set and allowing the equivalence test only at the end of the computation. We define the different variants of the model and compare their language recognition power with that of the classical models.

Includes members:
  Member "on reachability problems for low dimensional matrix semigroups":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "acceptance ambiguity for quantum automata")
  Member "extended finite automata and decision problems for matrix semigroups":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new results on vector and homing vector automata")
  Member "generalized results on monoids as memory":
    also connected through other hyperedges:
      (none)
  Member "on the identity problem for the special linear group and the heisenberg group":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the mortality problem from multiplicative matrix equations to linear recurrence sequences and beyond")
  Member "language classes associated with automata over matrix groups":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new results on vector and homing vector automata")
  Member "homing vector automata":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new results on vector and homing vector automata")
  Member "silent transitions in automata with storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the emptiness problem for valence automata over graph monoids")
  Member "real time vector automata":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new results on vector and homing vector automata")

Question: Please tell me which class the source paper 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)