Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
From MaRDI portal
Publication:3613330
DOI10.1007/11874683_6zbMath1225.68104OpenAlexW1891022440MaRDI QIDQ3613330
Publication date: 12 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.559.6734
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
A note on emptiness for alternating finite automata with a one-letter alphabet ⋮ On history-deterministic one-counter nets ⋮ Efficient determinization of visibly and height-deterministic pushdown automata
This page was built for publication: Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
