Solvability of the asynchronous ranking problem (Q1115578)
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: Solvability of the asynchronous ranking problem |
scientific article; zbMATH DE number 4086999
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solvability of the asynchronous ranking problem |
scientific article; zbMATH DE number 4086999 |
Statements
Solvability of the asynchronous ranking problem (English)
0 references
1988
0 references
The author shows that the ranking problem for a ring of n finite state machines is solvable if and only if n is prime.
0 references
finite automata
0 references
solvability
0 references
distributed system
0 references
ranking problem
0 references
finite state machines
0 references
