Geodesic
Distinguishability of vertices of automaton labyrinths by finite automata
Diskretnaya Matematika, Tome 3 (1991) no. 4, pp. 143-152.

Voir la notice de l'article provenant de la source Math-Net.Ru

We study the behavior of finite automata in automaton labyrinths. We introduce the concept of distinguishability by an automaton of vertices of labyrinths that is useful in various problems related to the recognition by an automaton of unknown characteristics of labyrinths. We obtain sharp estimates for the least time for an automaton to distinguish two distinguishable vertices of one or two automaton labyrinths. 
@article{DM_1991_3_4_a12,
     author = {G. Yu. Kudryavtsev},
     title = {Distinguishability of vertices of automaton labyrinths by finite automata},
     journal = {Diskretnaya Matematika},
     pages = {143--152},
     publisher = {mathdoc},
     volume = {3},
     number = {4},
     year = {1991},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1991_3_4_a12/}
}
TY  - JOUR
AU  - G. Yu. Kudryavtsev
TI  - Distinguishability of vertices of automaton labyrinths by finite automata
JO  - Diskretnaya Matematika
PY  - 1991
SP  - 143
EP  - 152
VL  - 3
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1991_3_4_a12/
LA  - ru
ID  - DM_1991_3_4_a12
ER  - 
%0 Journal Article
%A G. Yu. Kudryavtsev
%T Distinguishability of vertices of automaton labyrinths by finite automata
%J Diskretnaya Matematika
%D 1991
%P 143-152
%V 3
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1991_3_4_a12/
%G ru
%F DM_1991_3_4_a12
G. Yu. Kudryavtsev. Distinguishability of vertices of automaton labyrinths by finite automata. Diskretnaya Matematika, Tome 3 (1991) no. 4, pp. 143-152. http://geodesic.mathdoc.fr/item/DM_1991_3_4_a12/