Properties of Probabilistic Pushdown Automata

  title={Properties of Probabilistic Pushdown Automata},
  author={Ioan I. Macarie and Mitsunori Ogihara},
  journal={Theor. Comput. Sci.},

Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes

Here, the polynomial-time classes of multicounter machines with a constant number of reversals are considered and the computational power of nondeterminism, randomization and determinism is separated.

Efficient Analysis of Probabilistic Programs with an Unbounded Counter

It is shown that the expected termination time can be approximated up to an arbitrarily small relative error in polynomial time, and the same holds for the probability of all runs that satisfy a given ω-regular property encoded by a deterministic Rabin automaton.

Behavioral Strengths and Weaknesses of Various Models of Limited Automata

This work examines the behaviors of various models of k-limited automata, which naturally extend Hibbard’s scan limited automata and discusses fundamental properties of those machine models and obtains inclusions and separations among language families induced by these machine models.

On probabilistic pushdown automata

Probabilistic Length-Reducing Two-Pushdown Automata

  • T. Jurdzinski
  • Computer Science, Mathematics
    Theory of Computing Systems
  • 2007
It is shown that deterministic randomized length-reducing two-pushdown automata are weaker than Las Vegas and Monte Carlo automata, and bounded two-sided error are stronger than Monte Carlo s and they are able to recognize some languages which cannot be recognized nondeterministically.

On the Power of Randomized Pushdown Automata

The power of randomization for pushdown automata is investigated by investigating the power of decreasing error probabilities, and it is shown that deterministic push down automata are weaker than Las Vegas pushdown Automata, which in turn are stronger than one-sided-error pushdownAutomata.

Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems

This paper shows that checking classical and combined probabilistic similarity are EXPTIME-complete in both directions and become polynomial if both the number of control states of the pPDA and the size of the finite-state system are fixed.

Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition

This paper investigates the power of quantum pushdown automata whose stacks are assumed to be implemented as classical devices, and shows that they are strictly more powerful than their classical counterparts under the perfect-soundness condition.

Runtime Analysis of Probabilistic Programs with Unbounded Recursion

It is proved that for every pPDA the probability of performing a long run decreases exponentially in the length of the run, if and only if the expected runtime in the pPda is finite.

Model checking probabilistic pushdown automata

  • A. KuceraJ. EsparzaR. Mayr
  • Computer Science
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
This work considers the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various Probabilistic logics and proves that both qualitative and quantitative model checking for pPDA is decidable.



Multihead two-way probabilistic finite automata

  • I. Macarie
  • Computer Science
    Theory of Computing Systems
  • 2007
A simple formula is obtained for the maximum inherent bandwidth of the configuration transition matrices associated with thek-head probabilistic finite automata processing a length-n input string and possibilities for a space-efficient deterministic simulation of Probabilistic automata are discussed.

On the Structure of Log-Space Probabilistic Complexity Classes (Extended Abstract)

We investigate hierarchical properties and log-space reductions of languages recognized by log-space probabilistic Turing machines, Arthur-Merlin games, and Games against Nature with log-space

Tree-Size Bounded Alternation

Alternating Pushdown and Stack Automata

The classes of languages accepted by alternating pushdown automata, alternating stack Automata, and alternating nonerasing stack automata are characterized in terms of complexity classes defined by time bounded deterministic Turing machines.

Alternating Multihead Finite Automata

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

A class of machines called auxiliary pushdown machines is introduced, characterized in terms of time-bounded Turing machines, and corollaries are derived which answer some open questions in the field.

On the Tape Complexity of Deterministic Context-Free Languages

A tape hardest deterministic context-free language is described and the best upper bound known on the tape complexity of (deterministic) context- free languages is (log(n) 2).

Computational complexity of probabilistic Turing machines

It is shown how probabilisticlinear-bounded automata can simulate nondeterministic linear-bounding automata and an example is given of a function computable more quickly by Probabilistic Turing machines than by deterministic Turing machines.

Computational models of games

  • A. Condon
  • Computer Science
    ACM distinguished dissertations
  • 1989
A new computational model of two person games, called a probabilistic game automaton, is defined and a number of new results on the power of the space bounded analogues of Arthur-Merlin games and interactive proof systems are proved.

Depth reduction for noncommutative arithmetic circuits

The results show that OptSACi is contained in AC1, and other results relating Boolean and arithmetic circuit complexity are proved.