14 citations · 34 across the 16 of their papers we have counts for
5 papers · 1 filter
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…
Two-way Two-tape Automata
Olivier Carton, Léo Exibard, Olivier Serre
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such altern…
A survey on difference hierarchies of regular languages
Olivier Carton, Dominique Perrin, Jean-Éric Pin
Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of r…
An algebraic approach to MSO-definability on countable linear orderings
Olivier Carton, Thomas Colcombet, Gabriele Puppis
We develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability…
Finite-state Independence and Normal Sequences
Nicolás Álvarez, Verónica Becher, Olivier Carton
We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three…