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: "promise problems solved by quantum and classical finite automata"
  Abstract: The concept of promise problems was introduced and started to be systematically explored by Even, Selman, Yacobi, Goldreich, and other scholars. It has been argued that promise problems should be seen as partial decision problems and as such that they are more fundamental than decision problems and formal languages that used to be considered as the basic ones for complexity theory. The main purpose of this paper is to explore the promise problems accepted by classical, quantum and also semi-quantum finite automata. More specifically, we first introduce two acceptance modes of promise problems, recognizability and solvability, and explore their basic properties. Afterwards, we show several results concerning descriptional complexity on promise problems. In particular, we prove: (1) there is a promise problem that can be recognized exactly by measure-once one-way quantum finite automata (MO-1QFA), but no deterministic finite automata (DFA) can recognize it; (2) there is a promise problem that can be solved with error probability $\epsilon\leq 1/3$ by one-way finite automaton with quantum and classical states (1QCFA), but no one-way probability finite automaton (PFA) can solve it with error probability $\epsilon\leq 1/3$; and especially, (3) there are promise problems $A(p)$ with prime $p$ that can be solved {\em with any error probability} by MO-1QFA with only two quantum basis states, but they can not be solved exactly by any MO-1QFA with two quantum basis states; in contrast, the minimal PFA solving $A(p)$ with any error probability (usually smaller than $1/2$) has $p$ states. Finally, we mention a number of problems related to promise for further study.

Connected through hyperedge HE-1 (induced by source paper "quantum finite automata survey status and research directions"):
  with members:
    - "unary probabilistic and quantum automata on promise problems"
    - "power of the interactive proof systems with verifiers modeled by semi quantum two way finite automata"
    - "magic coins are useful for small space quantum machines"
    - "debates with small transparent quantum verifiers"
    - "from quantum query complexity to state complexity"
    - "classical and quantum realtime alternating automata"
    - "quantum finite automata a modern introduction"
    - "on the state complexity of semi quantum finite automata"

Connected through hyperedge HE-2 (induced by source paper "unary probabilistic and quantum automata on promise problems"):
  with members:
    - "new results on classical and quantum counter automata"
    - "potential of quantum finite automata with exact acceptance"
    - "very narrow quantum obdds and width hierarchies for classical obdds"
    - "classical automata on promise problems"
    - "quantum finite automata a modern introduction"
    - "on the state complexity of semi quantum finite automata"
    - "superiority of exact quantum automata for promise problems"
    - "unbounded error quantum computation with small space bounds"

Connected through hyperedge HE-3 (induced by source paper "new results on classical and quantum counter automata"):
  with members:
    - "automata and quantum computing"
    - "unary probabilistic and quantum automata on promise problems"
    - "potential of quantum finite automata with exact acceptance"
    - "classical automata on promise problems"
    - "quantum finite automata a modern introduction"
    - "quantum computation with write only memory"
    - "unbounded error quantum computation with small space bounds"
    - "two way finite automata with quantum and classical states"

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)