Pages that link to "Item:Q1405789"

The following pages link to Undecidable problems for probabilistic automata of fixed dimension (Q1405789):

Displaying 35 items.

• Lower bounds on complexity of Lyapunov functions for switched linear systems (Q286067) (← links)
• The complete realization problem for hidden Markov models: a survey and some new results (Q661032) (← links)
• Quantitative simulations by matrices (Q729815) (← links)
• On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
• The boundedness of all products of a pair of matrices is undecidable (Q1583220) (← links)
• Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
• Non-Sturmian sequences of matrices providing the maximum growth rate of matrix products (Q2081841) (← links)
• On eventual non-negativity and positivity for the weighted sum of powers of matrices (Q2104554) (← links)
• Polynomially ambiguous probabilistic automata on restricted languages (Q2121470) (← links)
• On injectivity of quantum finite automata (Q2229947) (← links)
• Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
• Freeness properties of weighted and probabilistic automata over bounded languages (Q2280319) (← links)
• The exact complexity of the infinite Post Correspondence Problem (Q2345861) (← links)
• Recursive stochastic games with positive rewards (Q2422034) (← links)
• On the finiteness property for rational matrices (Q2483265) (← links)
• Efficient algorithms for deciding the type of growth of products of integer matrices (Q2483266) (← links)
• When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
• Recursive Markov decision processes and recursive stochastic games (Q2796398) (← links)
• Trace Refinement in Labelled Markov Decision Processes (Q2811347) (← links)
• On the decidability of semigroup freeness. (Q2905326) (← links)
• Undecidability of infinite Post correspondence problem for instances of size 8 (Q2905329) (← links)
• Quantum Automata Theory – A Review (Q3098037) (← links)
• Probabilistic Weighted Automata (Q3184677) (← links)
• (Q3323274) (← links)
• Undecidability of infinite post correspondence problem for instances of Size 9 (Q3423136) (← links)
• Probabilistic Acceptors for Languages over Infinite Words (Q3599062) (← links)
• (Q4528870) (← links)
• (Q4585069) (← 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)
• Undecidable Problems for Probabilistic Network Programming (Q5111285) (← links)
• Artin’s Conjecture and Size of Finite Probabilistic Automata (Q5452183) (← links)
• Decision Questions for Probabilistic Automata on Small Alphabets (Q6137871) (← links)
• Quantifying opacity of discrete event systems modeled with probabilistic Petri nets (Q6539394) (← links)