Geodesic
Two-way finite probabilistic automata and Turing machines with bounded tape complexity
Doklady Akademii Nauk, Tome 256 (1981) no. 6, pp. 1326-1329.

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

@article{DAN_1981_256_6_a10,
     author = {R. V. Freivald},
     title = {Two-way finite probabilistic automata and {Turing} machines with bounded tape complexity},
     journal = {Doklady Akademii Nauk},
     pages = {1326--1329},
     publisher = {mathdoc},
     volume = {256},
     number = {6},
     year = {1981},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1981_256_6_a10/}
}
TY  - JOUR
AU  - R. V. Freivald
TI  - Two-way finite probabilistic automata and Turing machines with bounded tape complexity
JO  - Doklady Akademii Nauk
PY  - 1981
SP  - 1326
EP  - 1329
VL  - 256
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1981_256_6_a10/
LA  - ru
ID  - DAN_1981_256_6_a10
ER  - 
%0 Journal Article
%A R. V. Freivald
%T Two-way finite probabilistic automata and Turing machines with bounded tape complexity
%J Doklady Akademii Nauk
%D 1981
%P 1326-1329
%V 256
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1981_256_6_a10/
%G ru
%F DAN_1981_256_6_a10
R. V. Freivald. Two-way finite probabilistic automata and Turing machines with bounded tape complexity. Doklady Akademii Nauk, Tome 256 (1981) no. 6, pp. 1326-1329. http://geodesic.mathdoc.fr/item/DAN_1981_256_6_a10/