1 code implementation • 25 Sep 2018 • Christof Löding, Anton 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.
Formal Languages and Automata Theory
