Decidable Problems for Probabilistic Automata on Infinite Words

Krishnendu Chatterjee, Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012. pages 185-194, IEEE, 2012. [doi]

@inproceedings{ChatterjeeT12-0,
  title = {Decidable Problems for Probabilistic Automata on Infinite Words},
  author = {Krishnendu Chatterjee and Mathieu Tracol},
  year = {2012},
  doi = {10.1109/LICS.2012.29},
  url = {http://dx.doi.org/10.1109/LICS.2012.29},
  researchr = {https://researchr.org/publication/ChatterjeeT12-0},
  cites = {0},
  citedby = {0},
  pages = {185-194},
  booktitle = {Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012},
  publisher = {IEEE},
  isbn = {978-1-4673-2263-8},
}