2003/04/29 by A. Ben-Hur, Asa Ben‐Hur, Alexander Roitershtein +6
Computer Science · #Advanced Algebra and Logic #F.1.1 #F.1.2 #FOS: Computer and information sciences #Formal Methods in Verification #Other Computer Science (cs.OH) #cs.OH #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.cs/0304042
openalex publication_date 2003/04/29 · arxiv created 2003/04/30 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We 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.