The language recognized by a probabilistic finite automaton is undecidable, even under various restrictions on the automaton's parameters.
