activity
20072026
most citedThe Complexity of Infinite Computations In Models of Set Theory

10 citations · 57 across the 48 of their papers we have counts for

collaborators
Showing 2017Show all

2 papers · 1 filter

cs.LO2017★ 1 cited

Wadge Degrees of -Languages of Petri Nets

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…

math.LO2017

Polishness of some topologies related to word or tree automata

Olivier Finkel, Olivier Carton, Dominique Lecomte

We prove that the Büchi topology and the automatic topology are Polish. We also show that this cannot be fully extended to the case of a space of infinite labelled binary trees; in…