6 citations · 18 across the 8 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.FL2018★ 1 cited
Regular tree languages in low levels of the Wadge Hierarchy
Mikołaj Bojańczyk, Filippo Cavallari, Thomas Place +1
In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidabi…
cs.FL2018
Unambiguous languages exhaust the index hierarchy
Michał Skrzypczak
This work is a study of the expressive power of unambiguity in the case of automata over infinite trees. An automaton is called unambiguous if it has at most one accepting run on e…