Geodesic
Complexity of probabilistic automata which recognize regular
Doklady Akademii Nauk, Tome 270 (1983) no. 6, pp. 1340-1342

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

@article{DAN_1983_270_6_a13,
     author = {I. A. Pokrovskaya},
     title = {Complexity of probabilistic automata which recognize regular},
     journal = {Doklady Akademii Nauk},
     pages = {1340--1342},
     publisher = {mathdoc},
     volume = {270},
     number = {6},
     year = {1983},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1983_270_6_a13/}
}
TY  - JOUR
AU  - I. A. Pokrovskaya
TI  - Complexity of probabilistic automata which recognize regular
JO  - Doklady Akademii Nauk
PY  - 1983
SP  - 1340
EP  - 1342
VL  - 270
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1983_270_6_a13/
LA  - ru
ID  - DAN_1983_270_6_a13
ER  - 
%0 Journal Article
%A I. A. Pokrovskaya
%T Complexity of probabilistic automata which recognize regular
%J Doklady Akademii Nauk
%D 1983
%P 1340-1342
%V 270
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1983_270_6_a13/
%G ru
%F DAN_1983_270_6_a13
I. A. Pokrovskaya. Complexity of probabilistic automata which recognize regular. Doklady Akademii Nauk, Tome 270 (1983) no. 6, pp. 1340-1342. http://geodesic.mathdoc.fr/item/DAN_1983_270_6_a13/