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: "nested weighted automata"
  Abstract: Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.

Connected through hyperedge HE-1 (induced by source paper "streamable regular transductions"):
  with members:
    - "on the expressibility of copyless cost register automata"
    - "regular combinators for string transformations"
    - "decision problems for additive regular functions"
    - "streaming tree transducers"
    - "ltl with the freeze quantifier and register automata"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-2 (induced by source paper "decidable weighted expressions with presburger combinators"):
  with members:
    - "comparison of max plus automata and joint spectral radius of tropical matrices"
    - "quantitative languages defined by functional automata"
    - "regular combinators for string transformations"
    - "decision problems for additive regular functions"
    - "the complexity of mean payoff automaton expression"
    - "mean payoff automaton expressions"
    - "deciding unambiguity and sequentiality from a finitely ambiguous max plus automaton"

Connected through hyperedge HE-3 (induced by source paper "average stack cost of buechi pushdown automata"):
  with members:
    - "bidirectional nested weighted automata"
    - "weighted pushdown systems with indexed weight domains"
    - "average energy games"
    - "edit distance for pushdown automata"

Connected through hyperedge HE-4 (induced by source paper "bidirectional nested weighted automata"):
  with members:
    - "nested weighted limit average automata of bounded width"
    - "quantitative automata under probabilistic semantics"
    - "copyless cost register automata structure expressiveness and closure properties"
    - "expressiveness and closure properties for quantitative languages"

Connected through hyperedge HE-5 (induced by source paper "quantitative automata under probabilistic semantics"):
  with members:
    - "nested weighted limit average automata of bounded width"
    - "multigain a controller synthesis tool for mdps with multiple mean payoff objectives"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "markov decision processes with multiple long run averageobjectives"
    - "discounting in ltl"
    - "energy and mean payoff parity markov decision processes"
    - "measuring and synthesizing systems in probabilistic environments"
    - "expressiveness and closure properties for quantitative languages"

Connected through hyperedge HE-6 (induced by source paper "faster algorithms for quantitative verification in constant treewidth graphs"):
  with members:
    - "faster algorithms for markov decision processes with low treewidth"
    - "mean payoff pushdown games"
    - "the complexity of mean payoff automaton expression"
    - "measuring and synthesizing systems in probabilistic environments"
    - "expressiveness and closure properties for quantitative languages"
    - "mean payoff automaton expressions"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-7 (induced by source paper "edit distance for pushdown automata"):
  with members:
    - "mean payoff pushdown games"

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)