RUS
ENG
Full version
JOURNALS
// Doklady Akademii Nauk
// Archive
Dokl. Akad. Nauk SSSR,
1983
Volume 270,
Number 6,
Pages
1340–1342
(Mi dan10051)
CYBERNETICS AND THE REGULATION THEORY
Complexity of probabilistic automata which recognize regular languages
I. A. Pokrovskaya
UDC:
519.95
Presented:
A. N. Tikhonov
Received: 09.11.1982
Fulltext:
PDF file (440 kB)
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024
Fulltext:
PDF file (440 kB)