A Unifying Approach for Multistack Pushdown Automata

From MaRDI portal

Revision as of 20:13, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2922031

Jump to:navigation, search

DOI10.1007/978-3-662-44522-8_32zbMath1425.68215OpenAlexW56613915MaRDI QIDQ2922031

Gennaro Parlato, Salvatore La Torre, Margherita Napoli

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/365450/1/MFCS14.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Realizability of concurrent recursive programs ⋮ Ordered multi-stack visibly pushdown automata ⋮ Automata and Logics for Concurrent Systems: Five Models in Five Pages ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Visibly pushdown modular games ⋮ On the path-width of integer linear programming ⋮ A Perfect Class of Context-Sensitive Timed Languages

This page was built for publication: A Unifying Approach for Multistack Pushdown Automata

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2922031&oldid=15895596"