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: "a boyer moore type algorithm for timed pattern matching"
  Abstract: The timed pattern matching problem is formulated by Ulus et al. and has been actively studied since, with its evident application in monitoring real-time systems. The problem takes as input a timed word/signal and a timed pattern (specified either by a timed regular expression or by a timed automaton); and it returns the set of those intervals for which the given timed word, when restricted to the interval, matches the given pattern. We contribute a Boyer-Moore type optimization in timed pattern matching, relying on the classic Boyer-Moore string matching algorithm and its extension to (untimed) pattern matching by Watson and Watson. We assess its effect through experiments; for some problem instances our Boyer-Moore type optimization achieves speed-up by two times, indicating its potential in real-world monitoring tasks where data sets tend to be massive.

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"
    - "monaa a tool for timed pattern matching with automata based acceleration"
    - "an algebraic framework for runtime verification"
    - "efficient online timed pattern matching by automata based skipping"
    - "montre a tool for monitoring timed regular expressions"
    - "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"
    - "monaa a tool for timed pattern matching with automata based acceleration"
    - "efficient online timed pattern matching by automata based skipping"
    - "montre a tool for monitoring timed regular expressions"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

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

Connected through hyperedge HE-4 (induced by source paper "moore machine filtering for timed and untimed pattern matching"):
  with members:
    - "efficient online timed pattern matching by automata based skipping"
    - "montre a tool for monitoring timed regular expressions"

Connected through hyperedge HE-5 (induced by source paper "monaa a tool for timed pattern matching with automata based acceleration"):
  with members:
    - "efficient online timed pattern matching by automata based skipping"
    - "montre a tool for monitoring timed regular expressions"

Connected through hyperedge HE-6 (induced by source paper "efficient online timed pattern matching by automata based skipping"):
  with members:
    - "montre a tool for monitoring timed regular expressions"

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)