13 citations · 16 across the 9 of their papers we have counts for
1 paper · 1 filter
Christof Löding, Anton Pirogov
Probabilistic Büchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still ope…