Infinite Synchronizing Words for Probabilistic Automata (Erratum)
Formal Languages and Automata Theory
2012-06-06 v1
Abstract
In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the decidability result of [1-3] for the emptiness problem of weakly synchronizing language is incorrect.
Cite
@article{arxiv.1206.0995,
title = {Infinite Synchronizing Words for Probabilistic Automata (Erratum)},
author = {Laurent Doyen and Thierry Massart and Mahsa Shirmohammadi},
journal= {arXiv preprint arXiv:1206.0995},
year = {2012}
}
Comments
5 pages, 3 figures