2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31540We 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.Other Computer ScienceF.1.1; F.1.2text