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: "streaming tree transducers"
  Abstract: Theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack, and a finite number of variables that store output chunks that can be combined using the operations of string-concatenation and tree-insertion. We prove that the expressiveness of the model coincides with transductions definable using monadic second-order logic (MSO). Existing models of tree transducers either cannot implement all MSO-definable transformations, or require regular look ahead that prohibits single-pass implementation. We show a variety of analysis problems such as type-checking and checking functional equivalence are solvable for our model.

Connected through hyperedge HE-1 (induced by source paper "first order tree to tree functions"):
  with members:
    - "regular combinators for string transformations"
    - "wreath products of forest algebras with applications to tree logics"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-2 (induced by source paper "deciding equivalence of separated non nested attribute systems in polynomial time"):
  with members:
    - "equivalence of deterministic top down tree to string transducers is decidable"
    - "transducers with origin information"
    - "the equivalence problem for deterministic mso tree transducers is decidable"

Connected through hyperedge HE-3 (induced by source paper "streamable regular transductions"):
  with members:
    - "on the expressibility of copyless cost register automata"
    - "nested weighted automata"
    - "regular combinators for string transformations"
    - "decision problems for additive regular functions"
    - "ltl with the freeze quantifier and register automata"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-4 (induced by source paper "streamability of nested word transductions"):
  with members:
    - "randomized sliding window algorithms for regular languages"
    - "untwisting two way transducers in elementary time"
    - "two way visibly pushdown automata and transducers"
    - "streaming property testing of visibly pushdown languages"
    - "from two way to one way finite state transducers"
    - "on functionality of visibly pushdown transducers"
    - "validating xml documents in the streaming model with external memory"
    - "tight lower bounds for query processing on streaming and external memory data"

Connected through hyperedge HE-5 (induced by source paper "multiple context free tree grammars lexicalization and characterization"):
  with members:
    - "tree automata and tree grammars"
    - "deciding unambiguity and sequentiality from a finitely ambiguous max plus automaton"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-6 (induced by source paper "two way visibly pushdown automata and transducers"):
  with members:
    - "streamability of nested word transductions"
    - "equivalence of deterministic top down tree to string transducers is decidable"
    - "from two way to one way finite state transducers"
    - "transducers with origin information"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-7 (induced by source paper "equivalence of deterministic top down tree to string transducers is decidable"):
  with members:
    - "deciding equivalence of linear tree to word transducers in polynomial time"
    - "equivalence problems for tree transducers a brief survey"
    - "xquery streaming by forest transducers"
    - "the equivalence problem for deterministic mso tree transducers is decidable"

Connected through hyperedge HE-8 (induced by source paper "copyless cost register automata structure expressiveness and closure properties"):
  with members:
    - "decision problems for additive regular functions"
    - "regular functions cost register automata and generalized min cost problems"

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)