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: "monaa a tool for timed pattern matching with automata based acceleration"
  Abstract: We present mmonaa, a monitoring tool over a real-time property specified by either a timed automaton or a timed regular expression. It implements a timed pattern matching algorithm that combines 1) features suited for online monitoring, and 2) acceleration by automata-based skipping. Our experiments demonstrate \monaa's performance advantage, especially in online usage.

Connected through hyperedge HE-1 (induced by source paper "online quantitative timed pattern matching with semiring valued weighted automata"):
  with members:
    - "online parametric timed pattern matching with automata based skipping"
    - "symbolic monitoring against specifications parametric in time and data"
    - "offline timed pattern matching under uncertainty"
    - "an algebraic framework for runtime verification"
    - "efficient online timed pattern matching by automata based skipping"
    - "montre a tool for monitoring timed regular expressions"
    - "a boyer moore type algorithm for timed pattern matching"
    - "robust online monitoring of signal temporal logic"

Connected through hyperedge HE-2 (induced by source paper "online parametric timed pattern matching with automata based skipping"):
  with members:
    - "offline timed pattern matching under uncertainty"
    - "efficient online timed pattern matching by automata based skipping"
    - "montre a tool for monitoring timed regular expressions"
    - "a boyer moore type algorithm for timed pattern matching"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

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)