The following pages link to Probabilistic automata (Q5572344):
Displaying 50 items.
- Optimal cost almost-sure reachability in POMDPs (Q253969) (← links)
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Size lower bounds for quantum automata (Q403023) (← links)
- On probabilistic and quantum reaction systems (Q418773) (← links)
- Probabilistic grammars and languages (Q438593) (← links)
- Consistency and refinement for interval Markov chains (Q444461) (← links)
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Reachability problems for Markov chains (Q477610) (← links)
- Uniform and Bernoulli measures on the boundary of trace monoids (Q491977) (← links)
- Profinite techniques for probabilistic automata and the Markov monoid algorithm (Q529062) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- A lower bound for probabilistic algorithms for finite state machines (Q579936) (← links)
- On probabilistic analog automata (Q596111) (← links)
- Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
- A randomized algorithm for checking equivalence of circular lists (Q599509) (← links)
- Recurrence and transience for finite probabilistic tables (Q631776) (← links)
- The compositional construction of Markov processes (Q633811) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- Stabilization of probabilistic finite automata based on semi-tensor product of matrices (Q776109) (← links)
- Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546) (← links)
- On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
- On some variations of two-way probabilistic finite automata models (Q880179) (← links)
- Symmetry breaking in distributed networks (Q918187) (← links)
- Quantum inductive inference by finite automata (Q924168) (← links)
- Computation in finitary stochastic and quantum processes (Q933429) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- On metrics for probabilistic systems: definitions and algorithms (Q971582) (← links)
- Interacting with an artificial partner: modeling the role of emotional aspects (Q999435) (← links)
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata (Q1017410) (← links)
- A note on quantum sequential machines (Q1029358) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Randomized algorithms in combinatorial optimization: A survey (Q1077329) (← links)
- The complexity properties of probabilistic automata with isolated cut point (Q1102752) (← links)
- A nonlinear public key cryptosystem (Q1102923) (← links)
- Fast probabilistic algorithms for Hamiltonian circuits and matchings (Q1141153) (← links)
- Probabilistic automata (Q1151262) (← links)
- Projections of languages recognizable by probabilistic and alternating finite multitape automata (Q1167542) (← links)
- A note on two-way probabilistic automata (Q1195495) (← links)
- Grammatiche context-free su spazi metrici compatti (Q1213307) (← links)
- Realizations of fuzzy languages by probabilistic, max-product, and maximin automata (Q1220389) (← links)
- Probabilistic models of computer deadlock (Q1238423) (← links)
- On Markov chains generated by Markovian controlled Markov systems. I: Ergodic properties (Q1243563) (← links)
- Classes of formal grammars (Q1248342) (← links)
