The Decidability Frontier for Probabilistic Automata on Infinite Words
Logic in Computer Science
2011-04-28 v2 Formal Languages and Automata Theory
Abstract
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, B\"uchi, coB\"uchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.
Cite
@article{arxiv.1104.0127,
title = {The Decidability Frontier for Probabilistic Automata on Infinite Words},
author = {Krishnendu Chatterjee and Thomas A. Henzinger and Mathieu Tracol},
journal= {arXiv preprint arXiv:1104.0127},
year = {2011}
}