Pushing undecidability of the isolation problem for probabilistic automata

Details Pushing undecidability of the isolation problem for probabilistic automata Pushing undecidability of the isolation problem for probabilistic automata

2011-04-14

arxiv.org/abs/1104.3054v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

This short note aims at proving that the isolation problem is undecidable for probabilistic automata with only one probabilistic transition. This problem is known to be undecidable for general probabilistic automata, without restriction on the number of probabilistic transitions. In this note, we develop a simulation technique that allows to simulate any probabilistic automaton with one having only one probabilistic transition.

Affiliated with

Also associated with

No associations

Rating

Pushing undecidability of the isolation problem for probabilistic 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 Pushing undecidability of the isolation problem for probabilistic automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pushing undecidability of the isolation problem for probabilistic automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-167933