Visibly pushdown languages over sliding windows
From MaRDI portal
Recommendations
Cites work
- Approximate Hamming distance in a stream
- Automata theory on sliding windows
- Bounded Algol-Like Languages
- Dictionary matching in a stream
- Economy of description for single-valued transducers
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3310084 (Why is no real title available?)
- Maintaining Stream Statistics over Sliding Windows
- Minimization of Rational Word Functions
- On Context-Free Languages
- Optimal sampling from sliding windows
- Querying regular languages over sliding windows
- Reachability analysis of pushdown automata: Application to model-checking
- Real-time streaming string-matching
- Recognizing well-parenthesized expressions in the streaming model
- Regular canonical systems
- Regularity Problems for Visibly Pushdown Languages
- Sliding windows over context-free languages
- Streaming algorithms for language recognition problems
- Streaming Property Testing of Visibly Pushdown Languages *
- The \(k\)-mismatch problem revisited
- Visibly pushdown languages
Cited in
(4)
This page was built for publication: Visibly pushdown languages over sliding windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090478)
