Olivier Finkel

activity

20242026

collaborators

3 papers

cs.LO2026

Some complete $ω$ -powers of a one-counter language in the difference hierarchy

Jacques Duparc, Olivier Finkel, Dominique Lecomte

Fix a finite alphabet $Σ$ having at least two letters, and natural numbers $n, k \geq 1$ . We denote by $D_{n} (Π_{k}^{0})$ the class of differences of $n$ subsets of the Cantor space…

math.LO2025

Toward higher-order infinite time Turing machines: simulational $Γ$ -machines

Olivier Bournez, Olivier Finkel, Johan Girardot

Infinite time Turing machines (ITTMs) have been introduced by Hamkins and Lewis in their seminal article arXiv:math/9808093. The strength of the model comes from a limit rule which…

cs.LO2024

Wadge degrees of $Δ_{2}^{0}$ omega-powers

Olivier Finkel, Dominique Lecomte

We provide, for each natural number $n$ and each class among $D_{n} (Σ_{1}^{0})$ , $D ˉ_{n} (Σ_{1}^{0})$ and $D_{2 n + 1} (Σ_{1}^{0}) \oplus D ˉ_{2 n + 1} (Σ_{1}^{0})$ , a regular language whose associated om…

Some complete ω-powers of a one-counter language in the difference hierarchy

Toward higher-order infinite time Turing machines: simulational Γ-machines

Wadge degrees of Δ20​ omega-powers

Some complete $ω$ -powers of a one-counter language in the difference hierarchy

Toward higher-order infinite time Turing machines: simulational $Γ$ -machines

Wadge degrees of $Δ_{2}^{0}$ omega-powers