Geodesic
Comparative complexity of probabilistic and deterministic automata
Diskretnaya Matematika, Tome 3 (1991) no. 2, pp. 114-120
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

An estimate of complexity is obtained for the probabilistic automaton representing a language with an isolated section point. This estimate depends on the degree of isolation of the section point and on the automata structure of the language. Examples of languages are presented, which illustrate the relation between this estimate and the estimate obtained earlier by M. O. Rabin [Kibern. Sb. Nov. Ser. 9, 123–141 (1964)]. 
@article{DM_1991_3_2_a9,
     author = {F. M. Ablayev},
     title = {Comparative complexity of probabilistic and deterministic automata},
     journal = {Diskretnaya Matematika},
     pages = {114--120},
     year = {1991},
     volume = {3},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1991_3_2_a9/}
}
TY  - JOUR
AU  - F. M. Ablayev
TI  - Comparative complexity of probabilistic and deterministic automata
JO  - Diskretnaya Matematika
PY  - 1991
SP  - 114
EP  - 120
VL  - 3
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DM_1991_3_2_a9/
LA  - ru
ID  - DM_1991_3_2_a9
ER  - 
%0 Journal Article
%A F. M. Ablayev
%T Comparative complexity of probabilistic and deterministic automata
%J Diskretnaya Matematika
%D 1991
%P 114-120
%V 3
%N 2
%U http://geodesic.mathdoc.fr/item/DM_1991_3_2_a9/
%G ru
%F DM_1991_3_2_a9
F. M. Ablayev. Comparative complexity of probabilistic and deterministic automata. Diskretnaya Matematika, Tome 3 (1991) no. 2, pp. 114-120. http://geodesic.mathdoc.fr/item/DM_1991_3_2_a9/