10 citations · 57 across the 48 of their papers we have counts for
1 paper · 2 filters
Olivier Finkel
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…