Equivalences between probabilistic and deterministic sequential machines

DOI10.1016/S0019-9958(66)80012-8MaRDI QIDQ5530202zbMATH OpenOpenAlexFDO

Authors C. V. Page

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

zbMATH Keywords

information, communication

Cited in

(8)

• Probabilistic automata
• Various kinds of automata with weights
• 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
• The notion of a probabilistic cellular acceptor
• Deterministic representation of probabilistic systems by ergodic machines
• Über Automatenmodelle in der statistischen Lerntheorie

This page was built for publication: Equivalences between probabilistic and deterministic sequential machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5530202)