7 citations · 13 across the 10 of their papers we have counts for
1 paper · 1 filter
Christel Baier, Stefan Kiefer, Joachim Klein +2
Unambiguous automata are nondeterministic automata in which every word has at most one accepting run. In this paper we give a polynomial-time algorithm for model checking discrete-…