Asynchronous Parallel Communicating Systems of Pushdown Automata
From MaRDI portal
Publication:2949728
DOI10.1142/S0129054115500367zbMath1330.68173MaRDI QIDQ2949728
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
pushdown relation; asynchronous PC system; multi-head pushdown automaton; parallel communicating system of pushdown automata
68Q45: Formal languages and automata
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