8 citations · 13 across the 5 of their papers we have counts for
1 paper · 1 filter
Christof Löding, Anton Pirogov
Unambiguous Büchi automata, i.e. Büchi automata allowing only one accepting run per word, are a useful restriction of Büchi automata that is well-suited for probabilistic model-che…