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 the normal view instead:
scientific article; zbMATH DE number 6569400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9133892059326172
0 references
0.8616049885749817
0 references
0.8610742688179016
0 references
0.8574058413505554
0 references
0.8167885541915894
0 references
