Reduced forms for stochastic sequential machines
From MaRDI portal
Publication:1843416
DOI10.1016/0022-247X(63)90045-3zbMath0281.94038MaRDI QIDQ1843416
Publication date: 1963
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
Equivalence in automata theory based on complete residuated lattice-valued logic, Maximin sequential-like machines and chains, On the continuous dependence between a matrix product and its factors for finite systems of stochastic and substochastic matrices, Stochastic combinational networks, Implementability of numeric functions by probabilistic automata, On counting propositional logic and Wagner's hierarchy, Probabilistic automata, Minimization of probabilistic models of programs, Probabilistic Turing Machines and Computability, Another approach to the equivalence of measure-many one-way quantum finite automata and its application, Equivalence, reduction and minimization of finite fuzzy-automata, Finite \(L\)-fuzzy machines., Equivalence, reduction and minimization of finite automata over semirings, Computability by Probabilistic Turing Machines, Automata theory and control theory - a rapprochement, Fuzzy star functions, probabilistic automata, and their approximation by non-probabilistic automata, Maximin, Minimax, and composite sequential machines, Diagnostische Vorgabeexperimente mit stochastischen Automaten. (Diagnosing preset experiments with stochastic automata), Max-product machines, On reductions of maximin machines, Reduced forms for stochastic sequential machines, A general definition of stochastic automata, Adaptive stochastic cellular automata: Theory
Cites Work
- A Mathematical Theory of Communication
- Reduced forms for stochastic sequential machines
- Proof of Shannon's Transmission Theorem for Finite-State Indecomposable Channels
- On the Identifiability Problem for Functions of Finite Markov Chains
- On the Identifiability Problem for Functions of Finite Markov Chains
