Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation

DOI10.1007/11874683_6MaRDI QIDQ3613330zbMATH OpenOpenAlexFDO

Authors Jiří Srba

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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

• Beyond Language Equivalence on Visibly Pushdown Automata
• scientific article; zbMATH DE number 1929958
• Regularity Problems for Visibly Pushdown Languages
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
• Bisimilarity of probabilistic pushdown automata

Cited in

(8)

• On Model Checking for Visibly Pushdown Automata
• Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
• On history-deterministic one-counter nets
• A note on emptiness for alternating finite automata with a one-letter alphabet
• Regularity Problems for Visibly Pushdown Languages
• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• Beyond Language Equivalence on Visibly Pushdown Automata
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613330)