On the Expressive Power of 2-Stack Visibly Pushdown Automata

DOI10.2168/LMCS-4(4:16)2008zbMath1161.68023OpenAlexW3103530092MaRDI QIDQ3623011

Benedikt Bollig

Publication date: 29 April 2009

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

Full work available at URL: https://doi.org/10.2168/lmcs-4(4:16)2008

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

Realizability of concurrent recursive programs, Descriptional Complexity of Input-Driven Pushdown Automata, Ordered multi-stack visibly pushdown automata, Automata and Logics for Concurrent Systems: Five Models in Five Pages, Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic, Unnamed Item, Reachability of scope-bounded multistack pushdown systems, Descriptional complexity of unambiguous input-driven pushdown automata, Realizability of Concurrent Recursive Programs