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: "generalized eilenberg theorem i local varieties of languages"
  Abstract: We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages over an alphabet {\Sigma} closed under derivatives is isomorphic to the lattice of all pseudovarieties of {\Sigma}-generated monoids. By applying our method to different categories, we obtain three related results: one, due to Gehrke, Grigorieff and Pin, weakens boolean algebras to distributive lattices, one weakens them to join-semilattices, and the last one considers vector spaces over the binary field.

Connected through hyperedge HE-1 (induced by source paper "varieties of data languages"):
  with members:
    - "equational axiomatization of algebras with structure"
    - "unveiling eilenberg type correspondences birkhoff s theorem for finite algebras duality"
    - "eilenberg theorems for free"
    - "regular behaviours with names"
    - "automata theory in nominal sets"

Connected through hyperedge HE-2 (induced by source paper "syntactic structures of regular languages"):
  with members:
    - "one eilenberg theorem to rule them all"
    - "eilenberg theorems for free"
    - "recognisable languages over monads"
    - "varieties of languages in a category"
    - "profinite monads profinite equations and reiterman s theorem"
    - "on varieties of automata enriched with an algebraic structure extended abstract"
    - "proceedings 14th international conference on automata and formal languages"

Connected through hyperedge HE-3 (induced by source paper "one eilenberg theorem to rule them all"):
  with members:
    - "syntactic monoids in a category"
    - "recognisable languages over monads"
    - "varieties of languages in a category"
    - "profinite monads profinite equations and reiterman s theorem"
    - "a fibrational approach to automata theory"

Connected through hyperedge HE-4 (induced by source paper "profinite monads profinite equations and reiterman s theorem"):
  with members:
    - "syntactic monoids in a category"
    - "recognisable languages over monads"
    - "varieties of languages in a category"
    - "a fibrational approach to automata theory"

Connected through hyperedge HE-5 (induced by source paper "syntactic monoids in a category"):
  with members:
    - "recognisable languages over monads"
    - "sound and complete axiomatizations of coalgebraic language equivalence"

Connected through hyperedge HE-6 (induced by source paper "a fibrational approach to automata theory"):
  with members:
    - "varieties of languages in a category"

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)