The Language Theory of Bounded Context-Switching
From MaRDI portal
Publication:3557012
DOI10.1007/978-3-642-12200-2_10zbMath1283.68197OpenAlexW2120105239MaRDI QIDQ3557012
P. Madhusudan, Salvatore La Torre, Gennaro Parlato
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/272455/1/fulltext.pdf
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (8)
Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Ordered multi-stack visibly pushdown automata ⋮ Automata and Logics for Concurrent Systems: Five Models in Five Pages ⋮ Formal grammars for turn-bounded deterministic context-free languages ⋮ Bounded Context Switching for Valence Systems ⋮ Games on Multi-stack Pushdown Systems ⋮ A Perfect Class of Context-Sensitive Timed Languages ⋮ Unnamed Item
This page was built for publication: The Language Theory of Bounded Context-Switching
