Asynchronous systems of parallel communicating finite automata
From MaRDI portal
Publication:2805406
DOI10.3233/FI-2015-1149zbMATH Open1335.68092OpenAlexW1496951548MaRDI QIDQ2805406FDOQ2805406
Authors: Marcel Vollweiler
Publication date: 11 May 2016
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2015-1149
Recommendations
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (10)
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
- 2-asynchronous automata
- Asynchronous communicating cellular automata: formalization, robustness and equivalence
- Title not available (Why is that?)
- Undecidability and hierarchy results for parallel communicating finite automata
- Some undecidable problems for parallel communicating finite automata systems
- Title not available (Why is that?)
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Efficient simulation of synchronous systems by multi-speed systems
- Modeling and Programming Asynchronous Automata Networks: The MOCA Approach
This page was built for publication: Asynchronous systems of parallel communicating finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805406)