Cyclic Languages and Strongly Cyclic Languages. - Marie-Pierre Béal; Olivier Carton; Christophe Reutenauer (STACS, 1996)

Chain Automata. - Olivier Carton (Theor. Comput. Sci., 1996)

The Wadge-Wagner Hierarchy of omega-Rational Sets. - Olivier Carton; Dominique Perrin (ICALP, 1997)

Chains and Superchains for ω-Rational Sets, Automata and Semigroups. - Olivier Carton; Dominique Perrin (Int. J. Algebra Comput., 1997)

A Hierarchy of Cyclic Languages. - Olivier Carton (RAIRO Theor. Informatics Appl., 1997)

An Eilenberg Theorem for Words on Countable Ordinals. - Nicolas Bedon; Olivier Carton (LATIN, 1998)

The Wagner Hierarchy. - Olivier Carton; Dominique Perrin (Int. J. Algebra Comput., 1999)

Computing the Rabin Index of a Parity Automaton. - Olivier Carton; Ramón Maceiras (RAIRO Theor. Informatics Appl., 1999)

R-Trivial Languages of Words on Countable Ordinals. - Olivier Carton (Words, Languages & Combinatorics, 2000)

Determinization of Transducers over Infinite Words. - Marie-Pierre Béal; Olivier Carton (ICALP, 2000)

Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. - Marie-Pierre Béal; Olivier Carton; Christophe Prieur 002; Jacques Sakarovitch (LATIN, 2000)

Asynchronous sliding block maps. - Marie-Pierre Béal; Olivier Carton (RAIRO Theor. Informatics Appl., 2000)

Computing the prefix of an automaton. - Marie-Pierre Béal; Olivier Carton (RAIRO Theor. Informatics Appl., 2000)

Periodicity and roots of transfinite strings. - Olivier Carton; Christian Choffrut (RAIRO Theor. Informatics Appl., 2001)

Accessibility in Automata on Scattered Linear Orderings. - Olivier Carton (MFCS, 2002)

The Monadic Theory of Morphic Infinite Words and Generalizations. - Olivier Carton; Wolfgang Thomas (Inf. Comput., 2002)

Determinization of transducers over finite and infinite words. - Marie-Pierre Béal; Olivier Carton (Theor. Comput. Sci., 2002)

Operations Preserving Recognizable Languages. - Jean Berstel; Luc Boasson; Olivier Carton; Bruno Petazzoni; Jean-Eric Pin (FCT, 2003)

Unambiguous Automata on Bi-infinite Words. - Olivier Carton (MFCS, 2003)

Squaring transducers: an efficient procedure for deciding functionality and sequentiality. - Marie-Pierre Béal; Olivier Carton; Christophe Prieur 002; Jacques Sakarovitch (Theor. Comput. Sci., 2003)

Unambiguous Büchi automata. - Olivier Carton; Max Michel (Theor. Comput. Sci., 2003)

On the Complexity of Hopcroft's State Minimization Algorithm. - Jean Berstel; Olivier Carton (CIAA, 2004)

Determinization of Transducers over Infinite Words: The General Case. - Marie-Pierre Béal; Olivier Carton (Theory Comput. Syst., 2004)

Complementation of rational sets on countable scattered linear orderings. - Chloe Rispal; Olivier Carton (Int. J. Found. Comput. Sci., 2005)

Hierarchy Among Automata on Linear Orderings. - Véronique Bruyère; Olivier Carton (Theory Comput. Syst., 2005)

A Kleene Theorem for Languages of Words Indexed by Linear Orderings. - Alexis Bès; Olivier Carton (Int. J. Found. Comput. Sci., 2006)

Decision problems among the main subfamilies of rational relations. - Olivier Carton; Christian Choffrut; Serge Grigorieff (RAIRO Theor. Informatics Appl., 2006)

Operations preserving regular languages. - Jean Berstel; Luc Boasson; Olivier Carton; Bruno Petazzoni; Jean-Eric Pin (Theor. Comput. Sci., 2006)

A First Investigation of Sturmian Trees. - Jean Berstel; Luc Boasson; Olivier Carton; Isabelle Fagnot (STACS, 2007)

Automata on linear orderings. - Véronique Bruyère; Olivier Carton (J. Comput. Syst. Sci., 2007)

The growth ratio of synchronous rational relations is unique. - Olivier Carton (Theor. Comput. Sci., 2007)

Complementation of rational sets on scattered linear orderings of finite rank. - Olivier Carton; Chloe Rispal (Theor. Comput. Sci., 2007)

Automata and semigroups recognizing infinite words. - Olivier Carton; Dominique Perrin; Jean-Eric Pin (Logic and Automata, 2008)

On the continuity set of an Omega rational function. - Olivier Carton; Olivier Finkel; Pierre Simonnet (RAIRO Theor. Informatics Appl., 2008)

Left and Right Synchronous Relations. - Olivier Carton (Developments in Language Theory, 2009)

Infinite words without palindrome - Jean Berstel; Luc Boasson; Olivier Carton; Isabelle Fagnot (CoRR, 2009)

Tree Automata and Automata on Linear Orderings. - Véronique Bruyère; Olivier Carton; Géraud Sénizergues (RAIRO Theor. Informatics Appl., 2009)

Languages Recognized by Finite Supersoluble Groups. - Olivier Carton; Jean-Éric Pin; Xaro Soler-Escrivà (J. Autom. Lang. Comb., 2009)

Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. - Jean Berstel; Luc Boasson; Olivier Carton (Theor. Comput. Sci., 2009)

Right-Sequential Functions on Infinite Words. - Olivier Carton (CSR, 2010)

Minimization of Automata - Jean Berstel; Luc Boasson; Olivier Carton; Isabelle Fagnot (CoRR, 2010)

The expressive power of the shuffle product. - Jean Berstel; Luc Boasson; Olivier Carton; Jean-Eric Pin; Antonio Restivo (Inf. Comput., 2010)

Logic and Rational Languages of Words Indexed by Linear Orderings. - Nicolas Bedon; Alexis Bès; Olivier Carton; Chloe Rispal (Theory Comput. Syst., 2010)

Sturmian Trees. - Jean Berstel; Luc Boasson; Olivier Carton; Isabelle Fagnot (Theory Comput. Syst., 2010)

Algebraic Characterization of FO for Scattered Linear Orderings. - Alexis Bès; Olivier Carton (CSL, 2011)

Regular Languages of Words over Countable Linear Orderings. - Olivier Carton; Thomas Colcombet; Gabriele Puppis (ICALP (2), 2011)

Wavelength-Selective Shape Memory Alloy for Wireless Microactuation of a Bistable Curved Beam. - Sajid Zaidi; Frédéric Lamarque; Jérôme Favergeon; Olivier Carton; Christine Prelle (IEEE Trans. Ind. Electron., 2011)

Two-Way Transducers with a Two-Way Output Tape. - Olivier Carton (Developments in Language Theory, 2012)

An aperiodicity problem for multiwords. - Véronique Bruyère; Olivier Carton; Alexandre Decan; Olivier Gauwin; Jef Wijsen (RAIRO Theor. Informatics Appl., 2012)

Channel Synthesis Revisited. - Béatrice Bérard; Olivier Carton (LATA, 2014)

Asymptotic Monadic Second-Order Logic. - Achim Blumensath; Olivier Carton; Thomas Colcombet (MFCS (1), 2014)

Preface. - Marie-Pierre Béal; Olivier Carton (Int. J. Found. Comput. Sci., 2014)

Aperiodic Two-way Transducers and FO-Transductions. - Olivier Carton; Luc Dartois (CSL, 2015)

Rational Selecting Relations and Selectors. - Luc Boasson; Olivier Carton (LATA, 2015)

Normality and two-way automata. - Olivier Carton; Pablo Ariel Heiber (Inf. Comput., 2015)

Normality and automata. - Verónica Becher; Olivier Carton; Pablo Ariel Heiber (J. Comput. Syst. Sci., 2015)

Polishness of Some Topologies Related to Automata. - Olivier Carton; Olivier Finkel; Dominique Lecomte (CSL, 2017)

Two-Way Two-Tape Automata. - Olivier Carton; Léo Exibard; Olivier Serre (DLT, 2017)

Continuity and Rational Functions. - Michaël Cadilhac; Olivier Carton; Charles Paperman (ICALP, 2017)

Polishness of some topologies related to automata (Extended version). - Olivier Finkel; Olivier Carton; Dominique Lecomte (CoRR, 2017)

Counter Machines and Distributed Automata - A Story About Exchanging Space and Time. - Olivier Carton; Bruno Guillon; Fabian Reiter (Automata, 2018)

Simon's Theorem for Scattered Words. - Olivier Carton; Maurice Pouzet (DLT, 2018)

Normal numbers with digit dependencies. - Christoph Aistleitner; Verónica Becher; Olivier Carton (CoRR, 2018)

An Algebraic Approach to MSO-Definability on Countable linear Orderings. - Olivier Carton; Thomas Colcombet; Gabriele Puppis (J. Symb. Log., 2018)

A survey on difference hierarchies of regular languages. - Olivier Carton; Dominique Perrin; Jean-Éric Pin (Log. Methods Comput. Sci., 2018)

Finite-State Independence. - Verónica Becher; Olivier Carton; Pablo Ariel Heiber (Theory Comput. Syst., 2018)

Low discrepancy sequences failing Poissonian pair correlations. - Verónica Becher; Olivier Carton; Ignacio Mollo Cunningham (CoRR, 2019)

Normal numbers and nested perfect necklaces. - Verónica Becher; Olivier Carton (J. Complex., 2019)

Finite-state independence and normal sequences. - Nicolás Alvarez; Verónica Becher; Olivier Carton (J. Comput. Syst. Sci., 2019)

Polishness of some topologies related to word or tree automata. - Olivier Finkel; Olivier Carton; Dominique Lecomte (Log. Methods Comput. Sci., 2019)

A direct proof of Agafonov's theorem and an extension to shift of finite type. - Olivier Carton (CoRR, 2020)

Continuity of Functional Transducers: A Profinite Study of Rational Functions. - Michaël Cadilhac; Olivier Carton; Charles Paperman (Log. Methods Comput. Sci., 2020)

Transfinite Lyndon words. - Olivier Carton; Luc Boasson (Log. Methods Comput. Sci., 2020)

On Normality in Shifts of Finite Type. - Nicolás Alvarez; Olivier Carton (Theory Comput. Syst., 2020)

Minimisation of automata. - Jean Berstel; Luc Boasson; Olivier Carton; Isabelle Fagnot (Handbook of Automata Theory (I.), 2021)

Preservation of Normality by Non-Oblivious Group Selection. - Olivier Carton; Joseph Vandehey (Theory Comput. Syst., 2021)

Preservation of Normality by Unambiguous Transducers. - Olivier Carton (DLT, 2022)

Ambiguity Through the Lens of Measure Theory. - Olivier Carton (FSTTCS, 2022)

Continuous Rational Functions Are Deterministic Regular. - Olivier Carton; Gaëtan Douéneau-Tabot (MFCS, 2022)

Preservation of normality by transducers. - Olivier Carton; Elisa Orduna (Inf. Comput., 2022)

Deterministic Regular Functions of Infinite Words. - Olivier Carton; Gaëtan Douéneau-Tabot; Emmanuel Filiot; Sarah Winter (ICALP, 2023)

Nested perfect toroidal arrays. - Verónica Becher; Olivier Carton (CoRR, 2023)

Mahler equations for Zeckendorf numeration. - Olivier Carton; Reem Yassawi (CoRR, 2024)

Addition in Dumont-Thomas Numeration Systems in Theory and Practice. - Olivier Carton; Jean-Michel Couvreur; Martin Delacourt; Nicolas Ollinger (CoRR, 2024)

Rauzy dimension and finite-state dimension. - Verónica Becher; Olivier Carton; Santiago Figueira (CoRR, 2024)

Deterministic pushdown automata can compress some normal sequences. - Olivier Carton; Sylvain Perifel (Log. Methods Comput. Sci., 2024)

Nested Perfect Arrays. - Verónica Becher; Olivier Carton (IEEE Trans. Inf. Theory, 2024)

Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems. - Olivier Carton; Jean-Michel Couvreur; Martin Delacourt; Nicolas Ollinger (WORDS, 2025)

Rauzy complexity and block entropy. - Verónica Becher; Olivier Carton; Santiago Figueira (Inf. Comput., 2025)