Markov Chains as Random Input Automata
From MaRDI portal
Cited in
(6)- Probabilistic automata
- Synthesis of probability transformers
- Minimizing couplings in renormalization by preserving short-range mutual information
- The object allocation problem with favoring upper ranks
- On counting propositional logic and Wagner's hierarchy
- Quantum state discrimination via repeated measurements and the rule of three
This page was built for publication: Markov Chains as Random Input Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5508019)