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: "quantitative languages defined by functional automata"
  Abstract: A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs. On the positive side, we show that functionality is decidable for the four measures. Furthermore, the existential and universal threshold problems, the language inclusion problem and the equivalence problem are all decidable when the weighted automata are functional. On the negative side, we also study the quantitative extension of the realizability problem and show that it is undecidable for sum, mean and ratio. We finally show how to decide whether the language associated with a given functional automaton can be defined with a deterministic one, for sum, mean and discounted sum. The results on functionality and determinizability are expressed for the more general class of functional group automata. This allows one to formulate within the same framework new results related to discounted sum automata and known results on sum and mean automata. Ratio automata do not fit within this general scheme and different techniques are required to decide functionality.

Connected through hyperedge HE-1 (induced by source paper "sequentiality of string to context transducers"):
  with members:
    - "regular combinators for string transformations"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-2 (induced by source paper "a pattern logic for automata with outputs"):
  with members:
    - "degree of sequentiality of weighted automata"
    - "multi sequential word relations"

Connected through hyperedge HE-3 (induced by source paper "decidable weighted expressions with presburger combinators"):
  with members:
    - "comparison of max plus automata and joint spectral radius of tropical matrices"
    - "nested weighted 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-4 (induced by source paper "on delay and regret determinization of max plus automata"):
  with members:
    - "comparison of max plus automata and joint spectral radius of tropical matrices"
    - "on equivalence and uniformisation problems for finite transducers"
    - "reactive synthesis without regret"
    - "first cycle games"
    - "mean payoff automaton expressions"
    - "on the decomposition of k valued rational relations"

Connected through hyperedge HE-5 (induced by source paper "degree of sequentiality of weighted automata"):
  with members:
    - "multi sequential word relations"
    - "decision problems for additive regular functions"

Connected through hyperedge HE-6 (induced by source paper "nested weighted automata"):
  with members:
    - "mean payoff pushdown games"
    - "weighted logics for nested words and algebraic formal power series"
    - "expressiveness and closure properties for quantitative languages"
    - "mean payoff automaton expressions"
    - "probabilistic weighted automata"

Connected through hyperedge HE-7 (induced by source paper "weight assignment logic"):
  with members:
    - "a nivat theorem for weighted timed automata and weighted relative distance logic"
    - "multi weighted automata and mso logic"

Connected through hyperedge HE-8 (induced by source paper "variations on the stochastic shortest path problem"):
  with members:
    - "multiple environment markov decision processes"
    - "the odds of staying on budget"
    - "percentile queries in multi dimensional markov decision processes"
    - "expectations or guarantees i want it all a crossroad between games and mdps"
    - "to reach or not to reach efficient algorithms for total payoff games"
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "looking at mean payoff and total payoff through windows"
    - "computing quantiles in markov reward models"

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)