Geodesic
Stochasticity of languages that can be recognized by two-sided finite probabilistic automata
Diskretnaya Matematika, Tome 1 (1989) no. 4, pp. 405-421

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

We prove that with two-sided finite probabilistic automata only stochastic languages can be recognized, i.e., the capabilities of one-sided and two-sided finite probabilistic automata with a nonisolated point of intersection are identical with respect to recognition of languages. We give estimates for the increase in the number of states on passing from two-sided to one-sided automata that recognize the same language. 
@article{DM_1989_1_4_a6,
     author = {Ya. Ya. Kanep},
     title = {Stochasticity of languages that can be recognized by two-sided finite probabilistic automata},
     journal = {Diskretnaya Matematika},
     pages = {405--421},
     publisher = {mathdoc},
     volume = {1},
     number = {4},
     year = {1989},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1989_1_4_a6/}
}
TY  - JOUR
AU  - Ya. Ya. Kanep
TI  - Stochasticity of languages that can be recognized by two-sided finite probabilistic automata
JO  - Diskretnaya Matematika
PY  - 1989
SP  - 405
EP  - 421
VL  - 1
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1989_1_4_a6/
LA  - ru
ID  - DM_1989_1_4_a6
ER  - 
%0 Journal Article
%A Ya. Ya. Kanep
%T Stochasticity of languages that can be recognized by two-sided finite probabilistic automata
%J Diskretnaya Matematika
%D 1989
%P 405-421
%V 1
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1989_1_4_a6/
%G ru
%F DM_1989_1_4_a6
Ya. Ya. Kanep. Stochasticity of languages that can be recognized by two-sided finite probabilistic automata. Diskretnaya Matematika, Tome 1 (1989) no. 4, pp. 405-421. http://geodesic.mathdoc.fr/item/DM_1989_1_4_a6/