Bisimilarity of Probabilistic Pushdown Automata

DOI10.4230/LIPIcs.FSTTCS.2012.448zbMath1354.68152arXiv1210.2273MaRDI QIDQ2957520

Vojtěch Forejt, Stefan Kiefer, Petr Jančar, James Worrell

Publication date: 26 January 2017

Full work available at URL: https://arxiv.org/abs/1210.2273

zbMATH Keywords

pushdown automata; probabilistic systems; bisimilarity

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Unnamed Item, Language equivalence of probabilistic pushdown automata