Reachability Problem for Weak Multi-Pushdown Automata

DOI10.1007/978-3-642-32940-1_6zbMath1364.68247arXiv1308.3996OpenAlexW2103587987MaRDI QIDQ5891773

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

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

A Perfect Class of Context-Sensitive Timed Languages ⋮ Unnamed Item

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