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: "from two way to one way finite state transducers"
  Abstract: Any two-way finite state automaton is equivalent to some one-way finite state automaton. This well-known result, shown by Rabin and Scott and independently by Shepherdson, states that two-way finite state automata (even non-deterministic) characterize the class of regular languages. It is also known that this result does not extend to finite string transductions: (deterministic) two-way finite state transducers strictly extend the expressive power of (functional) one-way transducers. In particular deterministic two-way transducers capture exactly the class of MSO-transductions of finite strings. In this paper, we address the following definability problem: given a function defined by a two-way finite state transducer, is it definable by a one-way finite state transducer? By extending Rabin and Scott's proof to transductions, we show that this problem is decidable. Our procedure builds a one-way transducer, which is equivalent to the two-way transducer, whenever one exists.

Connected through hyperedge HE-1 (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"
    - "streaming tree 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-2 (induced by source paper "untwisting two way transducers in elementary time"):
  with members:
    - "first order definable string transformations"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-3 (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"
    - "transducers with origin information"
    - "streaming tree transducers"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-4 (induced by source paper "aperiodic string transducers"):
  with members:
    - "first order definable string transformations"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-5 (induced by source paper "transducers with origin information"):
  with members:
    - "mso definable string transductions and two way finite state transducers"

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)