Undecidable problems for probabilistic automata of fixed dimension
From MaRDI portal
Recommendations
- Decision problems for probabilistic finite automata on bounded languages
- Probabilistic automata on finite words: decidable and undecidable problems
- Quantum automata and algebraic groups
- Decidable problems for probabilistic automata on infinite words
- On the joint spectral radius for bounded matrix languages
Cited in
(42)- The boundedness of all products of a pair of matrices is undecidable
- Decision problems for semi-Thue systems with a few rules
- Non-Sturmian sequences of matrices providing the maximum growth rate of matrix products
- On eventual non-negativity and positivity for the weighted sum of powers of matrices
- Polynomially ambiguous probabilistic automata on restricted languages
- On injectivity of quantum finite automata
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
- Freeness properties of weighted and probabilistic automata over bounded languages
- The exact complexity of the infinite Post Correspondence Problem
- Undecidability and finite automata
- Recursive stochastic games with positive rewards
- On the finiteness property for rational matrices
- Efficient algorithms for deciding the type of growth of products of integer matrices
- When are emptiness and containment decidable for probabilistic automata?
- Recursive Markov decision processes and recursive stochastic games
- Lower bounds on complexity of Lyapunov functions for switched linear systems
- On the decidability of semigroup freeness.
- Undecidability of infinite Post correspondence problem for instances of size 8
- Two recursively inseparable problems for probabilistic automata
- Quantum automata theory -- a review
- Probabilistic Weighted Automata
- scientific article; zbMATH DE number 3854424 (Why is no real title available?)
- Undecidability of infinite post correspondence problem for instances of Size 9
- On the joint spectral radius for bounded matrix languages
- Probabilistic Acceptors for Languages over Infinite Words
- scientific article; zbMATH DE number 176526 (Why is no real title available?)
- scientific article; zbMATH DE number 1339970 (Why is no real title available?)
- scientific article; zbMATH DE number 1564050 (Why is no real title available?)
- Coalgebraic infinite traces and Kleisli simulations
- Decision problems for probabilistic finite automata on bounded languages
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages
- Acceptance Ambiguity for Quantum Automata
- Undecidable Problems for Probabilistic Network Programming
- Artin’s Conjecture and Size of Finite Probabilistic Automata
- Quantifying opacity of discrete event systems modeled with probabilistic Petri nets
- The complete realization problem for hidden Markov models: a survey and some new results
- Minimising the probabilistic bisimilarity distance
- Convex language semantics for nondeterministic probabilistic automata
- Quantitative simulations by matrices
- Probabilistic finite automaton emptiness is undecidable for a fixed automaton
- On the undecidability of probabilistic planning and related stochastic optimization problems
This page was built for publication: Undecidable problems for probabilistic automata of fixed dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405789)
