From Multi to Single Stack Automata

DOI10.1007/978-3-642-15375-4_9zbMath1287.68118OpenAlexW1878430332MaRDI QIDQ3584925

Mohamed Faouzi Atig

Publication date: 31 August 2010

Published in: CONCUR 2010 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15375-4_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Ordered multi-stack visibly pushdown automata ⋮ On store languages and applications ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete

This page was built for publication: From Multi to Single Stack Automata