×

Decidable problems for probabilistic automata on infinite words. (English) Zbl 1360.68546

Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, Dubrovnik, Croatia, June 25–28, 2012. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4769-5). 185-194 (2012).

MSC:

68Q45 Formal languages and automata
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q87 Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
PDFBibTeX XMLCite
Full Text: DOI arXiv