Affiliation:
1. Alan Turing Institute of Data Science and University of Warwick, UK
Abstract
The model of probabilistic automata was introduced by Rabin in 1963. Ever since, undecidability results were obtained for this model, showing that although simple, it is very expressive. This paper provides streamlined constructions implying the most important negative results, including the celebrated inapproximability result of Condon and Lipton.
Publisher
Association for Computing Machinery (ACM)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Big-O Problem;Logical Methods in Computer Science;2022-03-15
2. Probabilistic automata of bounded ambiguity;Information and Computation;2022-01
3. A Probabilistic Higher-order Fixpoint Logic;Logical Methods in Computer Science;2021-12-02
4. Controlling a random population;Logical Methods in Computer Science;2021-11-24
5. When are emptiness and containment decidable for probabilistic automata?;Journal of Computer and System Sciences;2021-08