Author:
Kaņeps Jānis,Geidmanis Dainis,Freivalds Rūsiņš
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. A.AMBAINIS, The complexity of probabilistic versus deterministic finite automata. Lecture Notes in Computer Science, 1178(1996).
2. R. FREIVALDS, Fast computation by probabilistic Turing machines. Proceedings of Latvian State University, 233 (1975), 201–205 (in Russian).
3. R. FREIVALDS, Fast probabilistic algorithms. Lecture Notes in Computer Science, 74 (1979), 57–69.
4. R. FREIVALDS, Projections of languages recognizable by probabilistic and alternating finite multitape automata. Information Processing Letters, V. 13, 1981, 195–198.
5. R.FREIVALDS, Capabilities of different models of 1-way probabilistic automata. Izvestija VUZ, Matematika, No.5 (228), 1981, 26–34 (in Russian).
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献