Geodesic
Approximate models of permutation automata
Diskretnaya Matematika, Tome 9 (1997) no. 1, pp. 103-122.

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

On the basis of metric properties of output sequences of finite automata approximate models for connected permutational automata, i.e., permutational automata with lesser number of states, are constructed. 
@article{DM_1997_9_1_a8,
     author = {A. V. Babash},
     title = {Approximate models of permutation automata},
     journal = {Diskretnaya Matematika},
     pages = {103--122},
     publisher = {mathdoc},
     volume = {9},
     number = {1},
     year = {1997},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1997_9_1_a8/}
}
TY  - JOUR
AU  - A. V. Babash
TI  - Approximate models of permutation automata
JO  - Diskretnaya Matematika
PY  - 1997
SP  - 103
EP  - 122
VL  - 9
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1997_9_1_a8/
LA  - ru
ID  - DM_1997_9_1_a8
ER  - 
%0 Journal Article
%A A. V. Babash
%T Approximate models of permutation automata
%J Diskretnaya Matematika
%D 1997
%P 103-122
%V 9
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1997_9_1_a8/
%G ru
%F DM_1997_9_1_a8
A. V. Babash. Approximate models of permutation automata. Diskretnaya Matematika, Tome 9 (1997) no. 1, pp. 103-122. http://geodesic.mathdoc.fr/item/DM_1997_9_1_a8/