# On the Power of Finite Automata with Both Nondeterministic and Probabilistic States

@article{Condon1998OnTP,
title={On the Power of Finite Automata with Both Nondeterministic and Probabilistic States},
author={Anne Condon and Lisa Hellerstein and Samuel Pottle and Avi Wigderson},
journal={SIAM J. Comput.},
year={1998},
volume={27},
pages={739-762}
}
• Published 1 June 1998
• Computer Science
• SIAM J. Comput.
We study finite automata with both nondeterministic and random states (npfa's). We restrict our attention to those npfa's that accept their languages with a small probability of error and run in polynomial expected time. Equivalently, we study Arthur--Merlin games where Arthur is limited to polynomial time and constant space. Dwork and Stockmeyer [SIAM J. Comput., 19 (1990), pp. 1011--1023] asked whether these npfa's accept only the regular languages (this was known if the automaton has only…
31 Citations

## Figures from this paper

### Research report: State complexity of operations on two-way quantum finite automata

A number of non-regular languages are presented and it is proved that these languages can be accepted by 2qfa's with one-sided error probabilities within linear time.

### Automaticity III: Polynomial automaticity and context-free languages

• Computer Science
computational complexity
• 1998
This paper first study the closure properties of the class DPA of languages of deterministic polynomial automaticity, i.e., those languages L for which there exists k such that A_L(n) = O(n^k ) and discusses similar results for a nondeterministic analogue of automaticity.

### Algebraic theory of minimal nondeterministic finite automata with applications

It is proved that an NFA recognizes a partial if its language extends the partial, meaning that the NFA’s behavior is unconstrained on unspecified strings; it follows that a minimal NFA for a partial is also minimal for its language.

### On the Structure of Logspace Probabilistic Complexity Classes

Probabilistic and probabilistic-plus-nondeterministic variants of Savitch's maze threading problem are found which are logspace complete for PL and PPP and which can be recognized by one-way non-sensing two-head finite-state automata with probabilists and nondeterministic states.

### Separating Small Space Complexity Classesof Stochastic Turing

• M. Li
• Computer Science
• 1996
This work investigates stochastic machines with space ressources between constant and logarithmic size and constant or sublinear bounds on the number of alternations between nondeterministic and probabilistic moves and establishes an innnite hierarchy with linear distance based on theNumber of alternation.

### Automaticity I: Properties of a Measure of Descriptional Complexity

• Mathematics
J. Comput. Syst. Sci.
• 1996
Let?and?be nonempty alphabets with?finite. Letfbe a function mapping?* to?. We explore the notion ofautomaticity, which attempts to model how “close”fis to a finite-state function. Formally, the

### Turing-equivalent automata using a fixed-size quantum memory

A new public quantum interactive proof system and the first quantum alternating Turing machine are introduced, obtained from their classical counterparts by augmenting them with a fixed-size quantum register, and it is shown that any Turing-recognizable language can be recognized by a constant-space qATM even with one-way input head.

### Recognizing /spl omega/-regular languages with probabilistic automata

• Computer Science
20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
• 2005
The main results are that the variant of probabilistic Buchi automata (PBA) is more expressive than non-deterministic /spl omega/-automata, but a certain subclass of PBA has exactly the power of /spl Omega/-regular languages.

## References

SHOWING 1-10 OF 31 REFERENCES

### On the power of finite automata with both nondeterministic and probabilistic states (preliminary version)

• Computer Science
STOC '94
• 1994
It is shown that a language has constant l-tiling complexity if and only if it is regular, and the last lower bound follows by proving that the characteristic matrix of ever-y nonregular language has rank n for infinitely many n.

### A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata

• Computer Science
SIAM J. Comput.
• 1990
It is shown that if a two-way probabilistic finite-state automaton (2pfa) M recognizes a nonregular language L with error probability bounded below $\frac{1}{2}$, then there is a positive constant b

### Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata

• Computer Science
ICALP
• 1991
The running time for the recognition of nonregular 2-dimensional languages by 4-way pfa can be essentially smaller, namely, linear.

### Probabilistic Game Automata

• Computer Science
Computational Complexity Conference
• 1986

### Finite state verifiers I: the power of interaction

• Computer Science
JACM
• 1992
An investigation of interactive proof systems (IPSs) where the verifier is a 2-way probabilistic finite state automaton (2pfa) is initiated, and it is shown that IPSs with verifiers in the latter class are as powerful as IPSs where verifiers are polynomial-time Probabilistic Turing machines.

### Automaticity: Properties of a Measure of Descriptional Complexity

• Mathematics
STACS
• 1994
The notion of automaticity is explored, which attempts to model how “close” f is to a finite-state function.

### 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.

### Proof verification and hardness of approximation problems

• Computer Science, Mathematics
Proceedings., 33rd Annual Symposium on Foundations of Computer Science
• 1992
The authors improve on their result by showing that NP=PCP(logn, 1), which has the following consequences: (1) MAXSNP-hard problems do not have polynomial time approximation schemes unless P=NP; and (2) for some epsilon >0 the size of the maximal clique in a graph cannot be approximated within a factor of n/sup ePSilon / unless P =NP.

### Lower bounds by probabilistic arguments

• A. Yao
• Computer Science, Mathematics
24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
• 1983
It is proved that, to compute the majority function of n Boolean variables, the size of any depth-3 monotone circuit must be greater than 2nε, and thesize of any width-2 branching program must have super-polynomial growth.