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: "transducers with origin information"
  Abstract: Call a string-to-string transducer regular if it can be realised by one of the following equivalent models: mso transductions, two-way deterministic automata with output, and streaming transducers with registers. This paper proposes to treat origin information as part of the semantics of a regular string-to-string transducer. With such semantics, the model admits a machine-independent characterisation, Angluin-style learning in polynomial time, as well as effective characterisations of natural subclasses such as one-way transducers or first-order definable transducers.

Connected through hyperedge HE-1 (induced by source paper "a buchi elgot trakhtenbrot theorem for automata with mso graph storage"):
  with members:
    - "string to string interpretations with polynomial size output"
    - "origin equivalence of two way word transducers is in pspace"
    - "weighted regular tree grammars with storage"
    - "dyck based characterizations of indexed languages"
    - "context free grammars with storage"
    - "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"
    - "streaming tree transducers"
    - "the equivalence problem for deterministic mso tree transducers is decidable"

Connected through hyperedge HE-3 (induced by source paper "on synthesis of resynchronizers for transducers"):
  with members:
    - "origin equivalence of two way word transducers is in pspace"
    - "on equivalence and uniformisation problems for finite transducers"

Connected through hyperedge HE-4 (induced by source paper "logics for word transductions with synthesis"):
  with members:
    - "the first reactive synthesis competition syntcomp 2014"
    - "on reversible transducers"
    - "on equivalence and uniformisation problems for finite transducers"
    - "regular combinators for string transformations"
    - "synthesis of deterministic top down tree transducers from automatic tree relations"
    - "a short note on two variable logic with a linear order successor and a preorder successor"
    - "two variable logic with two order relations"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-5 (induced by source paper "regular omega languages with an informative right congruence"):
  with members:
    - "families of dfas as acceptors of omega regular languages"
    - "learning regular languages over large ordered alphabets"

Connected through hyperedge HE-6 (induced by source paper "origin equivalence of two way word transducers is in pspace"):
  with members:
    - "logics for word transductions with synthesis"

Connected through hyperedge HE-7 (induced by source paper "logical and algebraic characterizations of rational transductions"):
  with members:
    - "continuity and rational functions"
    - "recognisable languages over monads"
    - "first order definable string transformations"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-8 (induced by source paper "decidable logics for transductions and data words"):
  with members:
    - "a short note on two variable logic with a linear order successor and a preorder successor"
    - "two variable logic with two order relations"

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)