The following pages link to (Q4143209):
Displaying 16 items.
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Recurrence and transience for finite probabilistic tables (Q631776) (← links)
- On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
- On the continuous dependence between a matrix product and its factors for finite systems of stochastic and substochastic matrices (Q1912455) (← links)
- Non-deterministic weighted automata evaluated over Markov chains (Q2009651) (← links)
- Polynomially ambiguous probabilistic automata on restricted languages (Q2121470) (← links)
- On injectivity of quantum finite automata (Q2229947) (← links)
- Freeness properties of weighted and probabilistic automata over bounded languages (Q2280319) (← links)
- Quantum automata and algebraic groups (Q2456549) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- Distributed Synthesis in Continuous Time (Q2811352) (← links)
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (Q5089287) (← links)
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Q5091267) (← links)
- Acceptance Ambiguity for Quantum Automata (Q5092433) (← links)
- Preface (Q5898759) (← links)
- Decision Questions for Probabilistic Automata on Small Alphabets (Q6137871) (← links)