Trimming visibly pushdown automata
From MaRDI portal
Publication:2344743
Recommendations
- Trimming visibly pushdown automata
- Minimizing Variants of Visibly Pushdown Automata
- Visibly pushdown automata and transducers with counters
- Beyond Language Equivalence on Visibly Pushdown Automata
- Efficient determinization of visibly and height-deterministic pushdown automata
- On Model Checking for Visibly Pushdown Automata
- 2-Visibly Pushdown Automata
- Two-way visibly pushdown automata and transducers
- Visibly pushdown automata: universality and inclusion via antichains
Cites work
- Adding nesting structure to words
- Automata, Languages and Programming
- scientific article; zbMATH DE number 3883637 (Why is no real title available?)
- scientific article; zbMATH DE number 3876636 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- On finite semigroups of matrices
- On the determinization of weighted finite automata
- Properties of visibly pushdown transducers
- Streamability of nested word transductions
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Visibly pushdown automata with multiplicities: finiteness and K-boundedness
- Visibly pushdown languages
- Visibly Pushdown Transducers
Cited in
(3)
This page was built for publication: Trimming visibly pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344743)
