Equivalences between probabilistic and deterministic sequential machines
From MaRDI portal
Publication:5530202
DOI10.1016/S0019-9958(66)80012-8zbMath0151.24801OpenAlexW2067935700MaRDI QIDQ5530202
Publication date: 1966
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(66)80012-8
Related Items
Über Automatenmodelle in der statistischen Lerntheorie ⋮ Probabilistic automata ⋮ Various kinds of automata with weights ⋮ The notion of a probabilistic cellular acceptor ⋮ Deterministic representation of probabilistic systems by ergodic machines ⋮ On Markov chains generated by Markovian controlled Markov systems. I: Ergodic properties ⋮ Fuzzy star functions, probabilistic automata, and their approximation by non-probabilistic automata ⋮ Realizations by stochastic finite automata