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: "semilinearity and context freeness of languages accepted by valence automata"
  Abstract: Valence automata are a generalization of various models of automata with storage. Here, each edge carries, in addition to an input word, an element of a monoid. A computation is considered valid if multiplying the monoid elements on the visited edges yields the identity element. By choosing suitable monoids, a variety of automata models can be obtained as special valence automata. #R##N#This work is concerned with the accepting power of valence automata. Specifically, we ask for which monoids valence automata can accept only context-free languages or only languages with semilinear Parikh image, respectively. #R##N#First, we present a characterization of those graph products (of monoids) for which valence automata accept only context-free languages. Second, we provide a necessary and sufficient condition for a graph product of copies of the bicyclic monoid and the integers to yield only languages with semilinear Parikh image when used as a storage mechanism in valence automata. Third, we show that all languages accepted by valence automata over torsion groups have a semilinear Parikh image.

Connected through hyperedge HE-1 (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"
    - "silent transitions in automata with storage"
    - "approximating petri net reachability along context free traces"

Connected through hyperedge HE-2 (induced by source paper "context free commutative grammars with integer counters and resets"):
  with members:
    - "approaching the coverability problem continuously"
    - "complexity of problems of commutative grammars"
    - "demystifying reachability in vector addition systems"
    - "tightening the complexity of equivalence problems for commutative grammars"
    - "unary pushdown automata and straight line programs"
    - "integer vector addition systems with states"
    - "subclasses of presburger arithmetic and the weak exp hierarchy"

Connected through hyperedge HE-3 (induced by source paper "integer vector addition systems with states"):
  with members:
    - "subclasses of presburger arithmetic and the weak exp hierarchy"
    - "on the complexity of counter reachability games"

Connected through hyperedge HE-4 (induced by source paper "monoid automata for displacement context free languages"):
  with members:
    - "silent transitions in automata with storage"
    - "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)