PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
From MaRDI portal
Publication:4528767
DOI10.1142/S0129054100000338zbMath0970.68090MaRDI QIDQ4528767
Victor Mitrana, Carlos Martín-Vide, György Vaszil, Erzsébet Csuhaj-Varjú
Publication date: 11 February 2001
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Teams of pushdown automata, Returning and non-returning parallel communicating finite automata are equivalent, Some undecidable problems for parallel communicating finite automata systems, Asynchronous Parallel Communicating Systems of Pushdown Automata
Cites Work
- Multiprocessor automata
- A note on semilinear sets and bounded-reversal multihead pushdown automata
- Stack cooperation in multistack pushdown automata
- A polynomial-time parsing algorithm for \(K\)-depth languages
- On non-determinacy in simple computing devices
- On two-way multihead automata
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS