Two Undecidability Results in Probabilistic Automata Theory
Author(s)
Kilian, Joseph J.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.
Date issued
1985-06Series/Report no.
MIT-LCS-TM-285