When are emptiness and containment decidable for probabilistic automata?
From MaRDI portal
Publication:2662671
DOI10.1016/j.jcss.2021.01.006zbMath1477.68150arXiv1804.09077OpenAlexW3128573148MaRDI QIDQ2662671
Filip Mazowiecki, Ranko Lazić, Laure Daviaud, Marcin Jurdziński, James Worrell, Guillermo A. Pérez
Publication date: 14 April 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.09077
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reachability problems for Markov chains
- Unbounded-error quantum computation with small space bounds
- On the degree of ambiguity of finite automata
- The covering and boundedness problems for vector addition systems
- Undecidable problems for probabilistic automata of fixed dimension
- Quantum automata and algebraic groups
- Deciding the value 1 problem for probabilistic leaktight automata
- Decidable and Expressive Classes of Probabilistic Automata
- What’s Decidable about Weighted Automata?
- Learning-Based Compositional Verification for Synchronous Probabilistic Systems
- On the definition of a family of automata
- Assume-Guarantee Verification for Probabilistic Systems
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- The Containment Problem for Unambiguous Register Automata
- Probabilistic Automata of Bounded Ambiguity
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
- Statistical Inference for Probabilistic Functions of Finite State Markov Chains
- Probabilistic automata
This page was built for publication: When are emptiness and containment decidable for probabilistic automata?
