Some aspects of probabilistic automata
From MaRDI portal
Publication:5530201
Cited in
(23)- Complexity of probabilistic versus deterministic automata
- Propriétés booléennes des langages stochastiques
- Deciding maxmin reachability in half-blind stochastic games
- The complexity of probabilistic versus deterministic finite automata
- Artin’s Conjecture and Size of Finite Probabilistic Automata
- Fuzzy star functions, probabilistic automata, and their approximation by non-probabilistic automata
- The Effect of Tossing Coins in Omega-Automata
- NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
- Contextuality, memory cost and non-classicality for sequential measurements
- Realizations by stochastic finite automata
- Probabilistic Acceptors for Languages over Infinite Words
- Generalized Automata and Stochastic Languages
- Zur Theorie abstrakter stochastischer Automaten
- Quantum automata theory -- a review
- A characterization of the class of structurally stable probabilistic automata II. Continuous-time case
- Adaptive stochastic cellular automata: Theory
- The notion of a probabilistic cellular acceptor
- Some considerations on Fuzzy automata
- Probabilistic automata
- On Markov chains generated by markovian controlled Markov systems: Structural stability
- On closure properties of \(\mathcal{L}\)-valued linear languages
- Stochastic grammars and languages
- Examples of formal grammars with weights
This page was built for publication: Some aspects of probabilistic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5530201)