2.1k citations · 3.9k across the 42 of their papers we have counts for
1 paper · 2 filters
Henryk Michalewski, Michał Skrzypczak
A non-deterministic automaton running on infinite trees is unambiguous if it has at most one accepting run on every tree. The class of languages recognisable by unambiguous tree au…