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 "varieties of data languages"):
  Abstract: We establish an Eilenberg-type correspondence for data languages, i.e. languages over an infinite alphabet. More precisely, we prove that there is a bijective correspondence between varieties of languages recognized by orbit-finite nominal monoids and pseudovarieties of such monoids. This is the first result of this kind for data languages. Our approach makes use of nominal Stone duality and a recent category theoretic generalization of Birkhoff-type HSP theorems that we instantiate here for the category of nominal sets. In addition, we prove an axiomatic characterization of weak pseudovarieties as those classes of orbit-finite monoids that can be specified by sequences of nominal equations, which provides a nominal version of a classical theorem of Eilenberg and Schutzenberger.

Includes members:
  Member "equational axiomatization of algebras with structure":
    also connected through other hyperedges:
      (none)
  Member "unveiling eilenberg type correspondences birkhoff s theorem for finite algebras duality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equational axiomatization of algebras with structure")
  Member "eilenberg theorems for free":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "automata learning an algebraic approach")
  Member "regular behaviours with names":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the behaviour of coalgebras with side effects and algebras with effectful iteration")
  Member "generalized eilenberg theorem i local varieties of languages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "syntactic structures of regular languages")
  Member "automata theory in nominal sets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "beyond sets with atoms definability in first order logic")

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)