Visibly pushdown automata and transducers with counters
From MaRDI portal
Publication:4589236
Recommendations
Cited in
(14)- On Model Checking for Visibly Pushdown Automata
- On the complexity of membership and counting in height-deterministic pushdown automata
- Input-Position-Restricted Models of Language Acceptors
- Verifying quantitative temporal properties of procedural programs
- Trimming visibly pushdown automata
- Event-Clock Visibly Pushdown Automata
- Visibly pushdown automata with multiplicities: finiteness and \(K\)-boundedness
- Input-driven multi-counter automata
- Pushdown automata with reversal-bounded counters
- Two-way Parikh automata with a visibly pushdown stack
- On store languages of language acceptors
- 2-Visibly Pushdown Automata
- Grammatical characterizations of NPDAs and VPDAs with counters
- On the Expressive Power of 2-Stack Visibly Pushdown Automata
This page was built for publication: Visibly pushdown automata and transducers with counters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589236)