Ioan I. Macarie  Home/Search
Context Related
| rochester.edu/pub/...nite_automata.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rochester.edu/trs/theorytrs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present properties of multihead two-way probabilistic finite automata that parallel those of their deterministic and nondeterministic counterparts. We define multihead probabilistic finite automata with log-space constructible transition probabilities, and we describe a simple technique to simulate these automata by standard log-space probabilistic Turing machines. Next, we represent log-space probabilistic complexity classes as proper hierarchies based on corresponding multihead two-way... (Update)
Context of citations to this paper: More
...from the next two lemmas. Slightly different proofs for these lemmas and other variations of this theorem can be found in [Ma93b]. The proofs for the other two claims are similar. 2 Lemma 1 S 1 k=1 kPFA = PrSpace rat (log n) Proof. The proof is an adaptation of the proof...
...On the other hand, the methods from [Ne63] Di90] do not work for other easy to construct transition probabilities. In contrast, in [Ma94c] there are presented techniques that handle transition probabilities given by real numbers constructible in log space. Consequently,...
Cited by: More
On the Structure of Log-Space Probabilistic Complexity Classes - Macarie (1994) (Correct)
Connections Among Space-Bounded and Multihead Probabilistic.. - Macarie (1994) (Correct)
Active bibliography (related documents): More All
1.6: Space-Efficient Deterministic Simulation of Probabilistic Automata - Macarie (1993) (Correct)
1.1: Aspekty Komunikacyjne Oblicze N Systemw Automatw Sko Nczonych - Jurdzinski (1999) (Correct)
0.7: Decreasing the Bandwidth of a Transition Matrix - Macarie (1994) (Correct)
Similar documents based on text: More All
0.6: Log Space Recognition and Translation of Parenthesis Languages - Lynch (1977) (Correct)
0.4: Amplification of Slight Probabilistic Advantage at.. - Ioan I. Macarie.. (1998) (Correct)
0.3: The Expressive Power of Transitive Closure and 2-way.. - Bargury, Makowsky (1992) (Correct)
Related documents from co-citation: More All
2: Relationships between nondeterministic and deterministic tape complexities (context) - Savitch - 1970
2: Stochasticity of the languages recognizable by 2-way finite probabilistic automa.. (context) - Kaneps - 1989
2: the difference between one and many (context) - Simon - 1977
BibTeX entry: (Update)
Macarie, I.I. Properties of multihead two-way probabilistic finite automata. TR477, Jan. 1994, Dept. of Computer Science, University of Rochester. http://citeseer.ist.psu.edu/macarie94properties.html More
@techreport{ macarie94properties,
author = "Ioan I. Macarie",
title = "Properties of multihead two-way probabilistic finite automata",
number = "TR477",
year = "1994",
url = "citeseer.ist.psu.edu/macarie94properties.html" }
Citations (may not include all citations):170 Nondeterministic space is closed under complementation - Immerman - 1988
145 Computational complexity of probabilistic Turing machines (context) - Gill - 1977
132 Relationships between nondeterministic and deterministic tap.. (context) - Savitch - 1970
73 Introduction to Probabilistic Automata (context) - Paz - 1971
54 Space-bounded reducibility among combinatorial problems (context) - Jones - 1975
37 Parallel computation for well-endowed rings and space-bounde.. (context) - Borodin, Cook et al. - 1983
32 Space-bounded hierarchies and probabilistic computation (context) - Ruzzo, Simon et al. - 1982
23 Probabilistic two-way machines (context) - Freivalds - 1981
22 Finite state verifiers I: the power of interaction (context) - Dwork, Stockmeyer - 1992
21 Memory bounds for recognition of context-free and context-se.. (context) - Lewis, Stearn et al. - 1965
18 New Problems Complete for Nondeterministic Log Space (context) - Jones, Lien - 1976
18 On probabilistic time and space (context) - Jung - 1985
17 Space-efficient deterministic simulations of probabilistic a.. - Macarie - 1994
16 Various techniques used in connection with random digits (context) - von Neumann - 1963
15 On probabilistic tape complexity and fast circuits for matri.. (context) - Jung - 1984
10 On Non-Determinancy in Simple Computing Devices (context) - Hartmanis - 1972
10 The method of forcing for nondeterministic automata (context) - Szelepcsenyi - 1987
9 Relationships between probabilistic and deterministic tape c.. (context) - Jung - 1981
9 the difference between one and many (context) - Simon - 1977
8 On Tape-Bounded Complexity Classes and Multihead Finite Auto.. (context) - Sudborough - 1975
8 Lower Space Bounds for Randomized Computation - Freivalds, Karpinski - 1994
6 Space-bounded probabilistic Turing machine complexity classe.. (context) - Simon - 1981
5 Regularity of one-letter languages acceptable by 2-way finit.. (context) - Kaneps - 1991
5 Two-way Multihead Automata over a one-letter alphabet (context) - Monien - 1980
5 Making a fair roulette from a possibly biased coin (context) - Dijkstra - 1990
4 Relating Refined Space Complexity Classes (context) - Seiferas - 1977
4 Stochasticity of the languages recognizable by 2-way finite .. (context) - Kaneps - 1989
4 Alternating multihead finite automata (context) - King - 1988
4 Avtomatika i vycislitelnaja tekhnika (context) - Yu, probabilistic - 1973
4 Computability by probabilistic Turing machines (context) - Santos - 1971
3 heads are better than K (context) - Yao, Rivest - 1978
3 Some Observations on 2-way Probabilistic Finite Automata (context) - Ravikumar - 1992
3 On languages representable in rational probabilistic automat.. (context) - Turakainen
3 Complexity of probabilistic versus deterministic automata (context) - Freivalds - 1991
2 Techniques for Separating Space Complexity Classes (context) - Seiferas - 1977
2 Transformational Methods and their Application to Complexity.. (context) - Monien - 1976
1 One two-way multihead automata (context) - Ibarra - 1973
Documents on the same site (http://www.cogsci.rochester.edu/trs/theory-trs.html): More
Downward Collapse from a Weaker Hypothesis - Hemaspaandra, Hemaspaandra.. (1998) (Correct)
On the Size of Classes with Weak Membership Properties - Zimand (Correct)
Translating Equality Downwards - Hemaspaandra, Hemaspaandra, Hempel (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC