# On finitely ambiguous Büchi automata

25 Sep 2018Christof LödingAnton Pirogov

Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive variant, namely finitely ambiguous B\"uchi automata, a generalisation where each word has at most $k$ accepting runs, for some fixed $k$... (read more)

PDF Abstract

No code implementations yet. Submit your code now