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: "the roles of advice to one tape linear time turing machines and finite automata"
  Abstract: We discuss the power and limitation of various "advice," when it is given particularly to weak computational models of one-tape linear-time Turing machines and one-way finite (state) automata. Of various advice types, we consider deterministically-chosen advice (not necessarily algorithmically determined) and randomly-chosen advice (according to certain probability distributions). In particular, we show that certain weak machines can be significantly enhanced in computational power when randomized advice is provided in place of deterministic advice.

Connected through hyperedge HE-1 (induced by source paper "nonuniform families of polynomial size quantum finite automata and quantum logarithmic space computation with polynomial size advice"):
  with members:
    - "state complexity characterizations of parameterized degree bounded graph connectivity sub linear space computation and the linear space hypothesis"
    - "the 2cnf boolean formula satisfiability problem and the linear space hypothesis"
    - "complexity bounds of constant space quantum computation"
    - "automata and quantum computing"
    - "classical automata on promise problems"
    - "oracle pushdown automata nondeterministic reducibilities and the cfl hierarchy over the family of context free languages"
    - "quantum computation with write only memory"
    - "unbounded error quantum computation with small space bounds"

Connected through hyperedge HE-2 (induced by source paper "structural complexity of multi valued partial functions computed by nondeterministic pushdown automata"):
  with members:
    - "oracle pushdown automata nondeterministic reducibilities and the cfl hierarchy over the family of context free languages"
    - "immunity and pseudorandomness of context free languages"
    - "multi head finite automata characterizations concepts and open problems"
    - "pseudorandom generators against advised context free languages"
    - "swapping lemmas for regular and context free languages"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-3 (induced by source paper "oracle pushdown automata nondeterministic reducibilities and the cfl hierarchy over the family of context free languages"):
  with members:
    - "the dissecting power of regular languages"
    - "immunity and pseudorandomness of context free languages"
    - "pseudorandom generators against advised context free languages"
    - "swapping lemmas for regular and context free languages"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-4 (induced by source paper "finite automata with advice tapes"):
  with members:
    - "quantum computation with write only memory"
    - "unbounded error quantum computation with small space bounds"
    - "immunity and pseudorandomness of context free languages"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-5 (induced by source paper "the dissecting power of regular languages"):
  with members:
    - "immunity and pseudorandomness of context free languages"
    - "swapping lemmas for regular and context free languages"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-6 (induced by source paper "pseudorandom generators against advised context free languages"):
  with members:
    - "structural complexity of multi valued partial functions computed by nondeterministic pushdown automata"
    - "oracle pushdown automata nondeterministic reducibilities and the cfl hierarchy over the family of context free languages"
    - "immunity and pseudorandomness of context free languages"
    - "swapping lemmas for regular and context free languages"
    - "theory of one tape linear time turing machines"

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)