Diskretnaya Matematika, Tome 3 (1991) no. 1, pp. 105-113
Citer cet article
A. N. Zyrichev. On the design of an automaton for traversing plane labyrinths with limited holes. Diskretnaya Matematika, Tome 3 (1991) no. 1, pp. 105-113. http://geodesic.mathdoc.fr/item/DM_1991_3_1_a9/
@article{DM_1991_3_1_a9,
author = {A. N. Zyrichev},
title = {On the design of an automaton for traversing plane labyrinths with limited holes},
journal = {Diskretnaya Matematika},
pages = {105--113},
year = {1991},
volume = {3},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_1991_3_1_a9/}
}
TY - JOUR
AU - A. N. Zyrichev
TI - On the design of an automaton for traversing plane labyrinths with limited holes
JO - Diskretnaya Matematika
PY - 1991
SP - 105
EP - 113
VL - 3
IS - 1
UR - http://geodesic.mathdoc.fr/item/DM_1991_3_1_a9/
LA - ru
ID - DM_1991_3_1_a9
ER -
%0 Journal Article
%A A. N. Zyrichev
%T On the design of an automaton for traversing plane labyrinths with limited holes
%J Diskretnaya Matematika
%D 1991
%P 105-113
%V 3
%N 1
%U http://geodesic.mathdoc.fr/item/DM_1991_3_1_a9/
%G ru
%F DM_1991_3_1_a9
We study a problem on the design of an automaton that traverses all the labyrinths of a given class. We constructively design an automaton that is universal for a class of labyrinths, the diameters of whose holes are bounded by a given constant $L$. The number of states of this automaton does not exceed $L^2$ in order.
