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 "from finite automata to regular expressions and back a summary on descriptional complexity"):
  Abstract: The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and lower bounds on the conversion of finite automata to regular expressions and vice versa. We also briefly recall the known bounds for the removal of spontaneous transitions (epsilon-transitions) on non-epsilon-free nondeterministic devices. Moreover, we report on recent results on the average case descriptional complexity bounds for the conversion of regular expressions to finite automata and brand new developments on the state elimination algorithm that converts finite automata to regular expressions.

Includes members:
  Member "a faster parameterized algorithm for treedepth":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space")
  Member "incomplete transition complexity of basic operations on finite languages":
    also connected through other hyperedges:
      (none)
  Member "enumerating regular expressions and their languages":
    also connected through other hyperedges:
      (none)
  Member "state elimination ordering strategies some experimental results":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "solving of regular equations revisited extended version")
  Member "regular expressions au point":
    also connected through other hyperedges:
      (none)
  Member "transition complexity of incomplete dfas":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "unrestricted state complexity of binary operations on regular and ideal languages")
  Member "succinctness of the complement and intersection of regular expressions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on k piecewise testability preliminary report")
  Member "unary finite automata vs arithmetic progressions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quadratic word equations with length constraints counter systems and presburger arithmetic with divisibility")

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)