Olivier Finkel

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 2020Show all

2 papers · 1 filter

cs.LO2020

Descriptive Set Theory and $ω$ -Powers of Finitary Languages

Olivier Finkel, Dominique Lecomte

The $ω$ -power of a finitary language L over a finite alphabet $Σ$ is the language of infinite words over $Σ$ defined by L $\infty$ := {w 0 w 1. .. $\in$ $Σ$ $ω$ | $\forall$ i $\in$ …

math.LO2020

Some complete $ω$ -powers of a one-counter language, for any Borel class of finite rank

Olivier Finkel, Dominique Lecomte

We prove that, for any natural number n $\geq$ 1, we can find a finite alphabet $Σ$ and a finitary language L over $Σ$ accepted by a one-counter automaton, such that the $ω$ -power L…

Descriptive Set Theory and ω-Powers of Finitary Languages

Some complete ω-powers of a one-counter language, for any Borel class of finite rank

Descriptive Set Theory and $ω$ -Powers of Finitary Languages

Some complete $ω$ -powers of a one-counter language, for any Borel class of finite rank