Beyond Language Equivalence on Visibly Pushdown Automata

DOI10.2168/LMCS-5(1:2)2009MaRDI QIDQ3623014zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
• scientific article; zbMATH DE number 1929958
• Regularity Problems for Visibly Pushdown Languages
• On Model Checking for Visibly Pushdown Automata
• Visibly pushdown languages

Cited in

(13)

• Minimization of visibly pushdown automata using partial Max-SAT
• Trimming visibly pushdown automata
• Automata, Languages and Programming
• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• On Model Checking for Visibly Pushdown Automata
• Countdown games, and simulation on (succinct) one-counter nets
• 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
• scientific article; zbMATH DE number 1929958 (Why is no real title available?)
• Simulation relations and applications in formal methods
• Visibly pushdown automata with multiplicities: finiteness and \(K\)-boundedness

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)