Formal language recognition by stochastic cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
Formal language recognition by stochastic cellular automata
Fundamenta Informaticae - Cellular Automata
| Hi-index | 0.00 |
The study of probabilistic one-way finite-state automata has been sparsely spread over at least thirty-three years, and across media that are not all readily accessible in the West at the present time. In a uniform setting, we present properties of the classes of languages specifiable by such automata. We present results found in a wide and nonhomogeneous literature together with original results. Along with probabilistic automata, we also study a clean generalized version. The classes of languages accepted by such automata are defined in terms of numerical cutpoints and the functions that these automata compute. Our main results are some closure properties for the classes and functions. We give a technique for proving stochasticity and we apply it in the case of some well-known languages.