Infinite Synchronizing Words for Probabilistic Automata (Erratum)
classification
💻 cs.FL
keywords
synchronizingautomataprobabilisticweaklyemptinesslanguagesproblemdecidability
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.