Probabilistic automata on finite words: decidable and undecidable problems
From MaRDI portal
Publication:3587465
Recommendations
Cited in
(55)- Distributed synthesis in continuous time
- Deciding maxmin reachability in half-blind stochastic games
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
- The complexity of probabilistic versus deterministic finite automata
- A survey of partial-observation stochastic parity games
- Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
- Emptiness of zero automata is decidable
- Artin’s Conjecture and Size of Finite Probabilistic Automata
- The big-O problem for labelled Markov chains and weighted automata
- Recurrence and transience for finite probabilistic tables
- Reachability analysis of quantum Markov decision processes
- Two recursively inseparable problems for probabilistic automata
- Probabilistic automata on infinite words: decidability and undecidability results
- Controlling a population
- Polynomially ambiguous probabilistic automata on restricted languages
- On regularity of unary probabilistic automata
- Profinite techniques for probabilistic automata
- The boundedness and zero isolation problems for weighted automata over nonnegative rationals
- Probabilistic automata with isolated cut-points
- The big-O problem
- Probabilistic disclosure: maximisation vs. minimisation
- Ambiguity, weakness, and regularity in probabilistic Büchi automata
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
- Diagnosis and degradation control for probabilistic systems
- On Decision Problems for Probabilistic Büchi Automata
- Decision problems for probabilistic finite automata on bounded languages
- Decidable problems for probabilistic automata on infinite words
- Deciding the value 1 problem for probabilistic leaktight automata
- Deciding the value 1 problem for probabilistic leaktight automata
- Probabilistic opacity for Markov decision processes
- Infinite Synchronizing Words for Probabilistic Automata
- Irregular behaviours for probabilistic automata
- POMDPs under probabilistic semantics
- scientific article; zbMATH DE number 7471672 (Why is no real title available?)
- scientific article; zbMATH DE number 7471675 (Why is no real title available?)
- scientific article; zbMATH DE number 7533339 (Why is no real title available?)
- Characterisation of an algebraic algorithm for probabilistic automata
- scientific article; zbMATH DE number 7089067 (Why is no real title available?)
- Measure quantifier in monadic second order logic
- On the termination problem for probabilistic higher-order recursive programs
- On eventual non-negativity and positivity for the weighted sum of powers of matrices
- Bisimulation metrics and norms for real-weighted automata
- When is containment decidable for probabilistic automata?
- Profinite techniques for probabilistic automata and the Markov monoid algorithm
- When are emptiness and containment decidable for probabilistic automata?
- Undecidable Problems for Probabilistic Network Programming
- Decidable and expressive classes of probabilistic automata
- The complexity of synchronizing Markov decision processes
- Undecidable problems for probabilistic automata of fixed dimension
- Partial-observation stochastic games, how to win when belief fails
- Probabilistic automata of bounded ambiguity
- Stochastization of weighted automata
- Controlling a random population
- Probabilistic automata of bounded ambiguity
- Emptiness problems for distributed automata
This page was built for publication: Probabilistic automata on finite words: decidable and undecidable problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587465)
