MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Properties of probabilistic pushdown automata (1998) [3 citations — 0 self]

Download:
pdf | ps
by Ioan I. Macarie, Mitsunori Ogihara
Theoretical Computer Science
ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr554.Properties_of_probabilistic_pushdown_automata.ps.gz
Add To MetaCart

Abstract:

Properties of probabilistic as well as "probabilistic plus nondeterministic " pushdown automata and auxiliary pushdown automata are studied. These models are analogous to their counterparts with nondeterministic and alternating states. Complete characterizations in terms of well-known complexity classes are given for the classes of languages recognized by polynomial time-bounded, logarithmic space-bounded auxiliary pushdown automata with probabilistic states and with "probabilistic plus nondeterministic " states. Also, complexity lower bounds are given for the classes of languages recognized by these automata with unlimited running time. It follows that, by fixing an appropriate mode of computation, the difference between classes of languages such as P and PSPACE, NL and SAC 1

Citations

2771 Introduction to Automata Theory, Languages and Computation – Hopcroft, Ullman - 1979
209 Computational complexity of probabilistic Turing machines – Gill - 1977
127 Private Coins versus Public Coins in Interactive Proof Systems. Advances in Computing Research: a research annual – Goldwasser, Sipser - 1989
82 Games against nature – Papadimitriou - 1985
65 On the tape complexity of deterministic context-free languages – Sudborough - 1978
59 Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits – Vinay - 1991
58 Tree-size bounded alternation – Ruzzo - 1980
29 Probabilistic two-way machines – Freivalds - 1981
27 Computational Models of Games – Condon - 1989
20 Alternating pushdown and stack automata – Ladner, Lipton, et al. - 1984
13 On non-determinancy in simple computing devices – Hartmanis - 1972
12 On Tape-Bounded Complexity Classes and Multihead Finite Automata – Sudborough - 1975
7 Transformational methods and their application to complexity problems – Monien - 1976
4 Two way deterministic pushdown automaton languages and some open problems in the theory of computation – Galil - 1974
4 Multihead Two-Way Probabilistic Finite Automata, Theory of Computing Systems 30(1 – Macarie - 1997
3 Alternating multihead finite automata – King - 1988
1 Depth reduciton for noncommutative arithmetic circuit – Allender, Jiao - 1993
1 Characterizations of pishdown machines in terms of time-bounded computers – Cook - 1971
1 Stochasticity of the languages recognized by 2-way finite probabilistic automata – Kaneps - 1989
1 On the structure of log-space probabilistic complexity classes – Macarie - 1994
1 Properties that characteriza LOGCFL – Venkateswaran - 1991
View or Download | Add to My Collection | Correct Errors