Geodesic
Indistinguishability of finite automata in a stationary observation environment
Diskretnaya Matematika, Tome 5 (1993) no. 4, pp. 43-53 
I. S. Grunskii; O. M. Kopytova. Indistinguishability of finite automata in a stationary observation environment. Diskretnaya Matematika, Tome 5 (1993) no. 4, pp. 43-53. http://geodesic.mathdoc.fr/item/DM_1993_5_4_a3/
@article{DM_1993_5_4_a3,
     author = {I. S. Grunskii and O. M. Kopytova},
     title = {Indistinguishability of finite automata in a~stationary observation environment},
     journal = {Diskretnaya Matematika},
     pages = {43--53},
     year = {1993},
     volume = {5},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1993_5_4_a3/}
}
TY  - JOUR
AU  - I. S. Grunskii
AU  - O. M. Kopytova
TI  - Indistinguishability of finite automata in a stationary observation environment
JO  - Diskretnaya Matematika
PY  - 1993
SP  - 43
EP  - 53
VL  - 5
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/DM_1993_5_4_a3/
LA  - ru
ID  - DM_1993_5_4_a3
ER  - 
%0 Journal Article
%A I. S. Grunskii
%A O. M. Kopytova
%T Indistinguishability of finite automata in a stationary observation environment
%J Diskretnaya Matematika
%D 1993
%P 43-53
%V 5
%N 4
%U http://geodesic.mathdoc.fr/item/DM_1993_5_4_a3/
%G ru
%F DM_1993_5_4_a3

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

We find criteria for the finiteness of classes of automata that are indistinguishable by simple experiments of unlimited and fixed length under the condition that, instead of an input-output sequence generated by an automaton, the experimenter observes the result of its coding by some discrete function (the observation environment). Under these same observation conditions we obtain a criterion for the chain condition of classes of automata that are indistinguishable by experiments of fixed length, with an increase in the length of the experiment.