most citedAn omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank

1 citations · 2 across the 11 of their papers we have counts for

collaborators

13 papers

cs.LO2008

Topological Complexity of omega-Powers : Extended Abstract

Olivier Finkel, Dominique Lecomte

This is an extended abstract presenting new results on the topological complexity of omega-powers (which are included in a paper "Classical and effective descriptive complexities o…

cs.CC2008

On the Continuity Set of an omega Rational Function

Olivier Carton, Olivier Finkel, Pierre Simonnet

In this paper, we study the continuity of rational functions realized by Büchi finite state transducers. It has been shown by Prieur that it can be decided whether such a function…

cs.CC2008

An omega-power of a context-free language which is Borel above Delta^0_omega

Jacques Duparc, Olivier Finkel

We use erasers-like basic operations on words to construct a set that is both Borel and above Delta^0_omega, built as a set V^ωwhere V is a language of finite words accepted by a p…

cs.LO2008

On Infinite Real Trace Rational Languages of Maximum Topological Complexity

Olivier Finkel, Jean-Pierre Ressayre, Pierre Simonnet

We consider the set of infinite real traces, over a dependence alphabet (Gamma, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove t…

cs.LO20081 cited

An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank

Olivier Finkel

Omega-powers of finitary languages are omega languages in the form V^omega, where V is a finitary language over a finite alphabet X. Since the set of infinite words over X can be e…

cs.LO2008

On the Length of the Wadge Hierarchy of Omega Context Free Languages

Olivier Finkel

We prove in this paper that the length of the Wadge hierarchy of omega context free languages is greater than the Cantor ordinal epsilon_omega, which is the omega-th fixed point of…