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 equivalence problem for deterministic mso tree transducers is decidable"
  Abstract: It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs.

Connected through hyperedge HE-1 (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"
    - "streaming tree transducers"

Connected through hyperedge HE-2 (induced by source paper "deciding equivalence of linear tree to word transducers in polynomial time"):
  with members:
    - "equivalence of deterministic top down tree to string transducers is decidable"

Connected through hyperedge HE-3 (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"
    - "streaming tree transducers"

Connected through hyperedge HE-4 (induced by source paper "equivalence problems for tree transducers a brief survey"):
  with members:
    - "expressiveness of visibly pushdown transducers"
    - "xquery streaming by forest transducers"
    - "look ahead removal for top down tree transducers"
    - "streaming tree transducers"

Connected through hyperedge HE-5 (induced by source paper "streaming tree transducers"):
  with members:
    - "streamability of nested word transductions"
    - "on streaming string transducers and hdt0l systems"
    - "xquery streaming by forest transducers"
    - "first order and temporal logics for nested words"
    - "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.LO(Logic in Computer Science)