Beyond Language Equivalence on Visibly Pushdown Automata
DOI10.2168/LMCS-5(1:2)2009zbMATH Open1164.68018OpenAlexW3104287458MaRDI QIDQ3623014FDOQ3623014
Authors: Jiří Srba 
Publication date: 29 April 2009
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-5(1:2)2009
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (13)
- Trimming visibly pushdown automata
- Automata, Languages and Programming
- On the Expressive Power of 2-Stack Visibly Pushdown Automata
- Countdown games, and simulation on (succinct) one-counter nets
- On Model Checking for Visibly Pushdown Automata
- Bisimulation equivalence and regularity for real-time one-counter automata
- Game characterization of probabilistic bisimilarity, and applications to pushdown automata
- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
- Regularity Problems for Visibly Pushdown Languages
- Title not available (Why is that?)
- Simulation relations and applications in formal methods
- Visibly pushdown automata with multiplicities: finiteness and \(K\)-boundedness
- Minimization of visibly pushdown automata using partial Max-SAT
This page was built for publication: Beyond Language Equivalence on Visibly Pushdown Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623014)
