On the Theory of Stochastic Automata
Merve Nur Cakir, Mehwish Saleemi, Karl-Heinz Zimmermann

TL;DR
This paper introduces the fundamental concepts of stochastic automata, exploring their properties, variants, and applications in modeling probabilistic systems, building on classical automata theory and extending it to stochastic contexts.
Contribution
It provides a comprehensive overview of stochastic automata theory, including equivalence, minimization, and stochastic language acceptance, expanding classical automata concepts into probabilistic frameworks.
Findings
Stochastic automata generalize deterministic automata with probabilistic transitions.
The paper discusses stochastic versions of Mealy and Moore automata.
Stochastic language acceptors extend nondeterministic finite automata.
Abstract
The theory of discrete stochastic systems has been initiated by the work of Shannon and von Neumann. While Shannon has considered memory-less communication channels and their generalization by introducing states, von Neumann has studied the synthesis of reliable systems from unreliable components. The fundamental work of Rabin and Scott about deterministic finite-state automata has led to two generalizations. First, the generalization of transition functions to conditional distributions studied by Carlyle and Starke. This in turn has led to a generalization of time-discrete Markov chains in which the chains are governed by more than one transition probability matrix. Second, the generalization of regular sets by introducing stochastic automata as described by Rabin. Stochastic automata are well-investigated. This report provides a short introduction to stochastic automata based on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · DNA and Biological Computing · Logic, programming, and type systems
