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: "silent transitions in automata with storage"
  Abstract: We consider the computational power of silent transitions in one-way automata with storage. Specifically, we ask which storage mechanisms admit a transformation of a given automaton into one that accepts the same language and reads at least one input symbol in each step. #R##N#We study this question using the model of valence automata. Here, a finite automaton is equipped with a storage mechanism that is given by a monoid. #R##N#This work presents generalizations of known results on silent transitions. For two classes of monoids, it provides characterizations of those monoids that allow the removal of \lambda-transitions. Both classes are defined by graph products of copies of the bicyclic monoid and the group of integers. The first class contains pushdown storages as well as the blind counters while the second class contains the blind and the partially blind counters.

Connected through hyperedge HE-1 (induced by source paper "extended models of finite automata"):
  with members:
    - "on reachability problems for low dimensional matrix semigroups"
    - "extended finite automata and decision problems for 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"
    - "real time vector automata"
    - "on the capabilities of grammars automata and transducers controlled by monoids"

Connected through hyperedge HE-2 (induced by source paper "the emptiness problem for valence automata over graph monoids"):
  with members:
    - "on the coverability problem for pushdown vector addition systems in one dimension"
    - "computing downward closures for stacked counter automata"
    - "semilinearity and context freeness of languages accepted by valence automata"
    - "approximating petri net reachability along context free traces"

Connected through hyperedge HE-3 (induced by source paper "an approach to computing downward closures"):
  with members:
    - "on infinite words determined by indexed languages"
    - "computing downward closures for stacked counter automata"
    - "regular cost functions part i logic and algebra over words"
    - "model checking vector addition systems with one zero test"

Connected through hyperedge HE-4 (induced by source paper "monoid automata for displacement context free languages"):
  with members:
    - "semilinearity and context freeness of languages accepted by valence automata"
    - "on the capabilities of grammars automata and transducers controlled by monoids"

Connected through hyperedge HE-5 (induced by source paper "semilinearity and context freeness of languages accepted by valence automata"):
  with members:
    - "on the capabilities of grammars automata and transducers controlled by monoids"

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)