On the complexity of timed pattern matching
From MaRDI portal
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)
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)