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/}
}
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/