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 "streamability of nested word transductions"):
  Abstract: We consider the problem of evaluating in streaming (i.e., in a single left-to-right pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that depends only on the size of T and on the height of the input word. We show that it is decidable in coNPTime for a nested word transduction defined by a visibly pushdown transducer (VPT), if it is HBM. In this case, the required amount of memory may depend exponentially on the height of the word. We exhibit a sufficient, decidable condition for a VPT to be evaluated with a memory that depends quadratically on the height of the word. This condition defines a class of transductions that strictly contains all determinizable VPTs.

Includes members:
  Member "randomized sliding window algorithms for regular languages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sliding window property testing for regular languages")
  Member "untwisting two way transducers in elementary time":
    also connected through other hyperedges:
      (none)
  Member "two way visibly pushdown automata and transducers":
    also connected through other hyperedges:
      (none)
  Member "streaming property testing of visibly pushdown languages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sliding window property testing for regular languages")
  Member "from two way to one way finite state transducers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "untwisting two way transducers in elementary time")
  Member "streaming tree transducers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "first order tree to tree functions")
  Member "on functionality of visibly pushdown transducers":
    also connected through other hyperedges:
      (none)
  Member "validating xml documents in the streaming model with external memory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "automata theory on sliding windows")

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)