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 "on computational complexity of set automata"):
  Abstract: We consider a computational model which is known as set automata. #R##N#The set automata are one-way finite automata with an additional storage---the set. There are two kinds of set automata---the deterministic and the nondeterministic ones. We denote them as DSA and NSA respectively. The model was introduced by M. Kutrib, A. Malcher, M. Wendlandt in 2014. It was shown that DSA-languages look similar to DCFL due to their closure properties and NSA-languages look similar to CFL due to their undecidability properties. #R##N#In this paper we show that this similarity is natural: we prove that languages recognizable by NSA form a rational cone, so as CFL. #R##N#The main topic of this paper is computational complexity: we prove that #R##N#- languages recognizable by DSA belong to P and there are P-complete languages among them; #R##N#- languages recognizable by NSA are in NP and there are NP-complete languages among them; #R##N#- the word membership problem is P-complete for DSA without epsilon-loops and PSPACE-complete for general DSA; #R##N#- the emptiness problem is in PSPACE for NSA and, moreover, it is PSPACE-complete for DSA.

Includes members:
  Member "regular realizability problems and context free languages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "circuit evaluation for finite semirings")
  Member "detecting palindromes patterns and borders in regular languages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "regular realizability problems and context free languages")

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)