Two Undecidability Results in Probabilistic Automata Theory

Abstract

The language accepted by a probabilistic finite state acceptor with an isolated cutpoint is known to be regular. We show that determining if a cutpoint is isolated is undecideable.