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

Master index

Pla general, del mural ceràmic que decora una de les parets del vestíbul de la Facultat de Química de la UB. El mural representa diversos símbols relacionats amb la química

A Survey on Continuous Time Computations

We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature

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 [20] and models of analog computation in a noisy environment suggested by Maass and Orponen [12], and Maass and Sontag [13]. Our main result is a generalization of Rabin’s reduction theorem that implies that under very mild conditions, the computational power of such automata is limited to regular languages