Abstract
Probabilistic automata are, at first glance, a mild generalisation of nondeterministic automata. It turns out, however, that adding probability makes natural questions undecidable, e.g. "decide if there is some word accepted with probability at least 1/2". In this column, Nathanaël Fijalkow explains this and other undecidability results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
