Beyond Language Equivalence on Visibly Pushdown Automata
From MaRDI portal
Publication:3623014
DOI10.2168/LMCS-5(1:2)2009zbMath1164.68018OpenAlexW3104287458MaRDI QIDQ3623014
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
Analysis of algorithms and problem complexity (68Q25) 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 (5)
Countdown games, and simulation on (succinct) one-counter nets ⋮ Bisimulation equivalence and regularity for real-time one-counter automata ⋮ Simulation relations and applications in formal methods ⋮ Minimization of Visibly Pushdown Automata Using Partial Max-SAT ⋮ Unnamed Item
This page was built for publication: Beyond Language Equivalence on Visibly Pushdown Automata
