Article
Licensed
Unlicensed
Requires Authentication
Collectives of automata in labyrinths
-
G. Kilibarda
Published/Copyright:
October 1, 2003
The behaviour of automata in labyrinths is a rather new field of automata theory, but more than one hundred papers devoted to this topic have been published. In this paper, we consider the key notions, problems, achievements, methods to solve problems, and open problems related to an important direction of this field, the behaviour of collectives of automata in labyrinths. In a series of cases, we give base assertions in a more strong form and give a more general presentation than the authors of the corresponding papers do. New results are also contained in this survey.
Published Online: 2003-10-01
Published in Print: 2003-10-01
Copyright 2003, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Collectives of automata in labyrinths
- On the complexity of the string generation problem
- On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
- On special properties of a composition of automata
- Limit distributions of the number of cycles of given length in a random permutation with given number of cycles
- Emergence of a giant component in a random permutation with given number of cycles
Articles in the same Issue
- Collectives of automata in labyrinths
- On the complexity of the string generation problem
- On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
- On special properties of a composition of automata
- Limit distributions of the number of cycles of given length in a random permutation with given number of cycles
- Emergence of a giant component in a random permutation with given number of cycles
