Communication of Two Stacks and Rewriting

DOI10.1007/11787006_40MaRDI QIDQ3591427zbMATH OpenOpenAlexFDO

Authors Juhani Karhumäki, Michal Kunc, Alexander Okhotin

Publication date 11 September 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11787006_40

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Computational power of two stacks with restricted communication
• scientific article; zbMATH DE number 6694449
• scientific article; zbMATH DE number 2087240
• scientific article; zbMATH DE number 2106350
• PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS

Cited in

(3)

• Computational power of two stacks with restricted communication
• The Reachability Problem over Infinite Graphs
• scientific article; zbMATH DE number 2087240 (Why is no real title available?)

This page was built for publication: Communication of Two Stacks and Rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591427)