Some undecidable problems for parallel communicating finite automata systems
From MaRDI portal
Publication:1603408
DOI10.1016/S0020-0190(00)00159-9zbMath0996.68083OpenAlexW2021540835WikidataQ127809458 ScholiaQ127809458MaRDI QIDQ1603408
Victor Mitrana, Carlos Martín-Vide
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00159-9
formal languagesequivalence problememptiness problemuniverse problemparallel communicating finite automata systems
Related Items (4)
UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA ⋮ Cellular Automata: Descriptional Complexity and Decidability ⋮ Efficient simulation of synchronous systems by multi-speed systems ⋮ On the closure of pattern expressions languages under intersection with regular languages
Cites Work
- Multiprocessor automata
- Stack cooperation in multistack pushdown automata
- On non-determinacy in simple computing devices
- On two-way multihead automata
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
- PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some undecidable problems for parallel communicating finite automata systems
