Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Independent systems of automata in labyrinths
-
G. Kilibarda
, V. B. Kudryavtsev und Š. Ušćumlić
Veröffentlicht/Copyright:
1. Juli 2003
We analyse the state of the art of a rather new field of automata theory—the study of behaviour of automata in labyrinths; more than a hundred publications devoted to this topic have been published. We consider key notions, problems, achievements, methods of problem solutions, and open problems in an important direction of this study, the behaviour of independent systems 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-07-01
Published in Print: 2003-07-01
Copyright 2003, Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Independent systems of automata in labyrinths
- Estimation of the time needed to set up a covert channel
- Schemes of public distribution of keys based on a non-commutative group
- Characteristic polynomials of multi-index transportation problems
- Construction of maximally non-Hamiltonian graphs
- Generating triples of involutions of large sporadic groups
- On the number of reversible homogeneous structures
- Random partitions of a set with given number of blocks
- On two statistics of chi-square type based on frequencies of tuples of states of a high-order Markov chain
Artikel in diesem Heft
- Independent systems of automata in labyrinths
- Estimation of the time needed to set up a covert channel
- Schemes of public distribution of keys based on a non-commutative group
- Characteristic polynomials of multi-index transportation problems
- Construction of maximally non-Hamiltonian graphs
- Generating triples of involutions of large sporadic groups
- On the number of reversible homogeneous structures
- Random partitions of a set with given number of blocks
- On two statistics of chi-square type based on frequencies of tuples of states of a high-order Markov chain