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 "decidable weighted expressions with presburger combinators"):
  Abstract: In this paper, we investigate the expressive power and the algorithmic properties of weighted expressions, which define functions from finite words to integers. First, we consider a slight extension of an expression formalism, introduced by Chatterjee. et. al. in the context of infinite words, by which to combine values given by unambiguous (max,+)-automata, using Presburger arithmetic. We show that important decision problems such as emptiness, universality and comparison are PSpace-c for these expressions. We then investigate the extension of these expressions with Kleene star. This allows to iterate an expression over smaller fragments of the input word, and to combine the results by taking their iterated sum. The decision problems turn out to be undecidable, but we introduce the decidable and still expressive class of synchronised expressions.

Includes members:
  Member "comparison of max plus automata and joint spectral radius of tropical matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on delay and regret determinization of max plus automata")
  Member "quantitative languages defined by functional automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sequentiality of string to context transducers")
  Member "nested weighted automata":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "streamable regular transductions")
  Member "regular combinators for string transformations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on string constraint solving")
  Member "decision problems for additive regular functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "pumping lemmas for weighted automata")
  Member "the complexity of mean payoff automaton expression":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "faster algorithms for quantitative verification in constant treewidth graphs")
  Member "mean payoff automaton expressions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on delay and regret determinization of max plus automata")
  Member "deciding unambiguity and sequentiality from a finitely ambiguous max plus automaton":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "pumping lemmas for weighted automata")

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)