On probabilistic analog automata

Details On probabilistic analog automata On probabilistic analog automata

2003-04-29

arxiv.org/abs/cs/0304042v2

Computer Science

Other Computer Science

Scientific paper

We consider probabilistic automata on a general state space and study their computational power. The model is based on the concept of language recognition by probabilistic automata due to Rabin and models of analog computation in a noisy environment suggested by Maass and Orponen, and Maass and Sontag. Our main result is a generalization of Rabin's reduction theorem that implies that under very mild conditions, the computational power of the automaton is limited to regular languages.

Affiliated with

Also associated with

No associations

Rating

On probabilistic analog automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On probabilistic analog automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On probabilistic analog automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333840