RUS
ENG
Full version
JOURNALS
// Doklady Akademii Nauk
// Archive
Dokl. Akad. Nauk SSSR,
1981
Volume 256,
Number 6,
Pages
1326–1329
(Mi dan44261)
MATHEMATICS
Two-way finite probabilistic automata and Turing machines with bounded tape complexity
R. V. Freivald
University of Latvia, Computing Center, Riga
UDC:
51.01:518.5
Presented:
A. N. Kolmogorov
Received: 03.10.1980
Fulltext:
PDF file (690 kB)
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024
Fulltext:
PDF file (690 kB)