Space and reversal complexity of probabilistic one-way turing machines-Reference-Cited by-同舟云学术

Space and reversal complexity of probabilistic one-way turing machines

Published:1983 Issue: Volume: Page:159-170
ISSN:0302-9743
Container-title:Foundations of Computation Theory
language:
Short-container-title:

Author:

Freivalds Rusins

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-12689-9_101.pdf

Reference11 articles.

1. Bukhstab A.A. Number theory. Ucpedgiz, 1960 (Russian).

2. Freivalds R. Fast computation by probabilistic Turing machines. — Ucenye Zapiski Latviiskogo Gosudarstvennogo Universiteta, v.233, 1975, 201–205 (Russian).

3. Freivalds R. Probabilistic machines can use less running time. — Information Processing '77, IFIP, North-Holland, 1977, 839–842.

4. Freivalds R. Capabilities of various models of probabilistic one-way automata. — Izvestiya VUZ. Matematika, No.5(228), 1981, 26–34 (Russian).

5. Freivalds R. Probabilistic two-way machines. — Lecture Notes in Computer Science, Springer, v.118, 1981, 33–45.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Uncountable Realtime Probabilistic Classes;International Journal of Foundations of Computer Science;2019-12

2. Uncountable Realtime Probabilistic Classes;Descriptional Complexity of Formal Systems;2017

3. New Results on the Minimum Amount of Useful Space;International Journal of Foundations of Computer Science;2016-02

4. The Minimum Amount of Useful Space: New Results and New Directions;Developments in Language Theory;2014

5. Lower space bounds for randomized computation;Automata, Languages and Programming;1994