On probabilistic analog automata
<|reference_start|>On probabilistic analog automata: 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.<|reference_end|>
@article{ben-hur2003on,
    title={On probabilistic analog automata},
    author={A. Ben-Hur, A. Roitershtein, H. Siegelmann},
    journal={arXiv preprint arXiv:cs/0304042},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0304042},
    primaryClass={cs.OH}
}