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 "not all multi valued partial cfl functions are refined by single valued functions"):
  Abstract: Multi-valued partial CFL functions are computed by one-way nondeterministic pushdown automata equipped with write-only output tapes. We give an answer to a fundamental question, raised by Konstantinidis, Santean, and Yu [Act. Inform. 43 (2007) 395-417], of whether all multi-valued partial CFL functions can be refined by single-valued partial CFL functions. We negatively solve this question by presenting a special multi-valued partial CFL function as an example function and by proving that no refinement of this particular function becomes a single-valued partial CFL function. This contrasts an early result of Kobayashi [Inform. Control 15 (1969) 95-109] that multi-valued partial NFA functions are always refined by single-valued NFA functions, where NFA functions are computed by nondeterministic finite automata with output tapes. Our example function turns out to be unambiguously 2-valued, and thus we obtain a stronger separation result, in which no refinement of unambiguously 2-valued partial CFL functions can be single-valued. For the proof, we first introduce a new concept of colored automata having no output tapes but having "colors," which can simulate pushdown automata with constant-space output tapes. We then conduct an extensive combinatorial analysis on the behaviors of transition records of stack contents (called stack histories) of colored automata.

Includes members:
  Member "structural complexity of multi valued partial functions computed by nondeterministic pushdown automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "uniform circuit and logarithmic space approximations of refined combinatorial optimization problems")
  Member "oracle pushdown automata nondeterministic reducibilities and the cfl hierarchy over the family of context free languages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nonuniform families of polynomial size quantum finite automata and quantum logarithmic space computation with polynomial size advice")
  Member "immunity and pseudorandomness of context free languages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "structural complexity of multi valued partial functions computed by nondeterministic pushdown automata")
  Member "pseudorandom generators against advised context free languages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nonuniform families of polynomial size quantum finite automata and quantum logarithmic space computation with polynomial size advice")
  Member "swapping lemmas for regular and context free languages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nonuniform families of polynomial size quantum finite automata and quantum logarithmic space computation with polynomial size advice")
  Member "theory of one tape linear time turing machines":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "classically time controlled quantum automata definition and properties")

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)