Finding probability characteristics of schemes in automaton bases
Diskretnaya Matematika, Tome 1 (1989) no. 1, pp. 29-31.

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

We consider schemes in arbitrary finite bases of finite probabilistic automata. We determine completely correct and correct schemes. We present a method for finding the probabilistic characteristics of such schemes.
@article{DM_1989_1_1_a3,
     author = {V. A. Orlov},
     title = {Finding probability characteristics of schemes in automaton bases},
     journal = {Diskretnaya Matematika},
     pages = {29--31},
     publisher = {mathdoc},
     volume = {1},
     number = {1},
     year = {1989},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1989_1_1_a3/}
}
TY  - JOUR
AU  - V. A. Orlov
TI  - Finding probability characteristics of schemes in automaton bases
JO  - Diskretnaya Matematika
PY  - 1989
SP  - 29
EP  - 31
VL  - 1
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1989_1_1_a3/
LA  - ru
ID  - DM_1989_1_1_a3
ER  - 
%0 Journal Article
%A V. A. Orlov
%T Finding probability characteristics of schemes in automaton bases
%J Diskretnaya Matematika
%D 1989
%P 29-31
%V 1
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1989_1_1_a3/
%G ru
%F DM_1989_1_1_a3
V. A. Orlov. Finding probability characteristics of schemes in automaton bases. Diskretnaya Matematika, Tome 1 (1989) no. 1, pp. 29-31. http://geodesic.mathdoc.fr/item/DM_1989_1_1_a3/