6 citations · 18 across the 8 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.FL2021
On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
Olivier Finkel, Michał Skrzypczak
We prove that -languages of (non-deterministic) Petri nets and -languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hie…
cs.FL2021
Deterministic and game separability for regular languages of infinite trees
Lorenzo Clemente, Michał Skrzypczak
We show that it is decidable whether two regular languages of infinite trees are separable by a deterministic language, resp., a game language. We consider two variants of separabi…