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 "a buchi elgot trakhtenbrot theorem for automata with mso graph storage"):
  Abstract: We introduce MSO graph storage types, and call a storage type MSO-expressible if it is isomorphic to some MSO graph storage type. An MSO graph storage type has MSO-definable sets of graphs as storage configurations and as storage transformations. We consider sequential automata with MSO graph storage and associate with each such automaton a string language (in the usual way) and a graph language; a graph is accepted by the automaton if it represents a correct sequence of storage configurations for a given input string. For each MSO graph storage type, we define an MSO logic which is a subset of the usual MSO logic on graphs. We prove a Buchi-Elgot-Trakhtenbrot theorem, both for the string case and the graph case. Moreover, we prove that (i) each MSO graph transduction can be used as storage transformation in an MSO graph storage type and (ii) the pushdown operator on storage types preserves the property of MSO-expressibility. Thus, the iterated pushdown storage types are MSO-expressible.

Includes members:
  Member "string to string interpretations with polynomial size output":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "typed lambda calculi and superclasses of regular functions")
  Member "origin equivalence of two way word transducers is in pspace":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "regular resynchronizability of origin transducers is undecidable")
  Member "weighted regular tree grammars with storage":
    also connected through other hyperedges:
      (none)
  Member "dyck based characterizations of indexed languages":
    also connected through other hyperedges:
      (none)
  Member "context free grammars with storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linear bounded composition of tree walking tree transducers linear size increase and complexity")
  Member "transducers with origin information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deciding equivalence of separated non nested attribute systems in polynomial time")
  Member "mso definable string transductions and two way finite state transducers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "first order tree to tree functions")

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)