Reachability Problem for Weak Multi-Pushdown Automata

DOI10.2168/LMCS-9(3:13)2013zbMath1274.68156OpenAlexW2036539537MaRDI QIDQ5891173

Sławomir Lasota, Wojciech Czerwiński, Piotr Hofman

Publication date: 26 September 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-9(3:13)2013

zbMATH Keywords

reachabilitypushdown automataregular setsmulti-pushdown automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Decidable models of integer-manipulating programs with recursive parallelism

This page was built for publication: Reachability Problem for Weak Multi-Pushdown Automata