6 citations · 18 across the 8 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.LO2014
On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets
Olivier Finkel, Michał Skrzypczak
We show that there are -complete languages of infinite words accepted by non-deterministic Petri nets with Büchi acceptance condition, or equivalently by Büchi blind counter…
cs.FL2014★ 1 cited
Unambiguous Buchi is weak
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…