On the Expressive Power of 2-Stack Visibly Pushdown Automata
From MaRDI portal
Recommendations
- 2-Visibly Pushdown Automata
- Two-way visibly pushdown automata and transducers
- Two-way Parikh automata with a visibly pushdown stack
- Beyond Language Equivalence on Visibly Pushdown Automata
- Expressiveness of visibly pushdown transducers
- Efficient determinization of visibly and height-deterministic pushdown automata
- scientific article; zbMATH DE number 3926247
- Visibly pushdown automata and transducers with counters
- The power of two-way deterministic checking stack automata
- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Cited in
(14)- Realizability of concurrent recursive programs
- Visit-bounded stack automata
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Reachability of scope-bounded multistack pushdown systems
- Two-way Parikh automata with a visibly pushdown stack
- A unifying approach for multistack pushdown automata
- Automata and Logics for Concurrent Systems: Five Models in Five Pages
- Descriptional complexity of input-driven pushdown automata
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Ordered multi-stack visibly pushdown automata
- Realizability of Concurrent Recursive Programs
- Descriptional complexity of unambiguous input-driven pushdown automata
- 2-Visibly Pushdown Automata
- Visit-bounded stack automata
This page was built for publication: On the Expressive Power of 2-Stack Visibly Pushdown Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623011)
