Sciweavers

Share
RP
2015
Springer

Irregular Behaviours for Probabilistic Automata

3 years 1 months ago
Irregular Behaviours for Probabilistic Automata
Abstract. We consider probabilistic automata over finite words. Such an automaton defines the language consisting of the set of words accepted with probability greater than a given threshold. We show the existence of a universally non-regular probabilistic automaton, i.e. an automaton such that the language it defines is non-regular for every threshold. As a corollary, we obtain an alternative and very simple proof of the undecidability of determining whether such a language is regular.
Nathanaël Fijalkow, Michal Skrzypczak
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Where RP
Authors Nathanaël Fijalkow, Michal Skrzypczak
Comments (0)
books