On the complexity of timed pattern matching

DOI10.1007/978-3-030-85037-1_2OpenAlexW3196175986WikidataQ124213265 ScholiaQ124213265MaRDI QIDQ832025

Eugene Asarin, Dogan Ulus, Thomas Ferrère, Dejan Ničković

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85037-1_2

zbMATH Keywords

complexitypattern matchingtimed regular expressions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• timed-pattern-matching
• Montre

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Online timed pattern matching using automata
• On the quantitative semantics of regular expressions over real-valued signals
• Efficient online timed pattern matching by automata-based skipping
• Online timed pattern matching using derivatives
• Reachability in two-clock timed automata is PSPACE-complete
• Carathéodory bounds for integer cones
• Timed regular expressions
• Linear Arithmetic with Stars
• A Boyer-Moore Type Algorithm for Timed Pattern Matching
• Timed Pattern Matching

This page was built for publication: On the complexity of timed pattern matching