Asynchronous Parallel Communicating Systems of Pushdown Automata

DOI10.1142/S0129054115500367zbMath1330.68173OpenAlexW1869556578MaRDI QIDQ2949728

Friedrich Otto

Publication date: 2 October 2015

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

Full work available at URL: https://doi.org/10.1142/s0129054115500367

zbMATH Keywords

pushdown relationasynchronous PC systemmulti-head pushdown automatonparallel communicating system of pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Hierarchies of one-way multihead automata languages
• k\(+1\) heads are better than k for PDAs
• Growing context-sensitive languages and Church-Rosser languages
• Properties of syntax directed translations
• Systems of parallel communicating restarting automata
• ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA
• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• Properties of Finite and Pushdown Transducers
• PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
• Returning and non-returning parallel communicating finite automata are equivalent
• Multi-tape and multi-head pushdown automata

This page was built for publication: Asynchronous Parallel Communicating Systems of Pushdown Automata