Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities (Q2800414)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities |
scientific article; zbMATH DE number 6569400
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities |
scientific article; zbMATH DE number 6569400 |
Statements
15 April 2016
0 references
distributed computation
0 references
systems of finite automata
0 references
complexity induced by communication
0 references
Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities (English)
0 references
