On the complexity of timed pattern matching

DOI10.1007/978-3-030-85037-1_2MaRDI QIDQ832025zbMATH OpenOpenAlexWikidataFDO

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

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)

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 1530301 (Why is no real title available?)
• scientific article; zbMATH DE number 2086412 (Why is no real title available?)
• A Boyer-Moore type algorithm for timed pattern matching
• A theory of timed automata
• Carathéodory bounds for integer cones
• Efficient online timed pattern matching by automata-based skipping
• Linear Arithmetic with Stars
• On the quantitative semantics of regular expressions over real-valued signals
• Online timed pattern matching using automata
• Online timed pattern matching using derivatives
• Reachability in two-clock timed automata is PSPACE-complete
• Real-time automata
• Timed pattern matching
• Timed regular expressions

Cited in

(2)

• On the computational complexity of 2-interval pattern matching problems
• A faster parameterized algorithm for temporal matching

Describes a project that uses

Uses Software

• timed-pattern-matching
• Montre

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832025)