Olivier Carton

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 46

Top Venues

CoRR

Log. Methods Comput. Sci.

DLT

Theory Comput. Syst.

Publications

Olivier Carton, Reem Yassawi
Mahler equations for Zeckendorf numeration. CoRR (2024)
Olivier Carton, Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger
Addition in Dumont-Thomas Numeration Systems in Theory and Practice. CoRR (2024)
Olivier Carton, Sylvain Perifel
Deterministic pushdown automata can compress some normal sequences. Log. Methods Comput. Sci. 20 (3) (2024)
Verónica Becher, Olivier Carton, Santiago Figueira
Rauzy dimension and finite-state dimension. CoRR (2024)
Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot, Sarah Winter
Deterministic regular functions of infinite words. CoRR (2023)
Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot, Sarah Winter
Deterministic Regular Functions of Infinite Words. ICALP (2023)
Verónica Becher, Olivier Carton
Nested perfect toroidal arrays. CoRR (2023)
Olivier Carton, Gaëtan Douéneau-Tabot
Continuous Rational Functions Are Deterministic Regular. MFCS (2022)
Olivier Carton, Sylvain Perifel
Deterministic pushdown automata can compress some normal sequences. CoRR (2022)
Olivier Carton
Preservation of Normality by Unambiguous Transducers. DLT (2022)
Olivier Carton
Ambiguity Through the Lens of Measure Theory. FSTTCS (2022)
Olivier Carton, Elisa Orduna
Preservation of normality by transducers. Inf. Comput. 282 (2022)
Olivier Carton, Gaëtan Douéneau-Tabot
Continuous rational functions are deterministic regular. CoRR (2022)
Olivier Carton, Luc Dartois
Aperiodic two-way transducers and FO-transductions. CoRR (2021)
Olivier Carton, Joseph Vandehey
Preservation of Normality by Non-Oblivious Group Selection. Theory Comput. Syst. 65 (2) (2021)
Olivier Carton
Preservation of normality by unambiguous transducers. CoRR (2020)
Nicolás Alvarez, Olivier Carton
On Normality in Shifts of Finite Type. Theory Comput. Syst. 64 (5) (2020)
Michaël Cadilhac, Olivier Carton, Charles Paperman
Continuity of Functional Transducers: A Profinite Study of Rational Functions. Log. Methods Comput. Sci. 16 (1) (2020)
Olivier Carton
Ambiguity through the lens of measure theory. CoRR (2020)
Olivier Carton
A direct proof of Agafonov's theorem and an extension to shift of finite type. CoRR (2020)
Olivier Carton, Luc Boasson
Transfinite Lyndon words. Log. Methods Comput. Sci. 16 (4) (2020)
Verónica Becher, Olivier Carton
Normal numbers and nested perfect necklaces. J. Complex. 54 (2019)
Olivier Carton, Joseph Vandehey
Preservation of normality by non-oblivious group selection. CoRR (2019)
Olivier Carton, Elisa Orduna
Preservation of normality by transducers. CoRR (2019)
Verónica Becher, Olivier Carton, Ignacio Mollo Cunningham
Low discrepancy sequences failing Poissonian pair correlations. CoRR (2019)
Olivier Finkel, Olivier Carton, Dominique Lecomte
Polishness of some topologies related to word or tree automata. Log. Methods Comput. Sci. 15 (2) (2019)
Nicolás Alvarez, Verónica Becher, Olivier Carton
Finite-state independence and normal sequences. J. Comput. Syst. Sci. 103 (2019)
Olivier Carton, Bruno Guillon, Fabian Reiter
Counter Machines and Distributed Automata - A Story About Exchanging Space and Time. Automata (2018)
Verónica Becher, Olivier Carton, Pablo Ariel Heiber
Finite-State Independence. Theory Comput. Syst. 62 (7) (2018)
Michaël Cadilhac, Olivier Carton, Charles Paperman
Continuity and Rational Functions. CoRR (2018)
Olivier Carton, Bruno Guillon, Fabian Reiter
Counter Machines and Distributed Automata: A Story about Exchanging Space and Time. CoRR (2018)
Nicolás Alvarez, Olivier Carton
On normality in shifts of finite type. CoRR (2018)
Olivier Carton, Thomas Colcombet, Gabriele Puppis
An Algebraic Approach to MSO-Definability on Countable linear Orderings. J. Symb. Log. 83 (3) (2018)
Christoph Aistleitner, Verónica Becher, Olivier Carton
Normal numbers with digit dependencies. CoRR (2018)
Olivier Carton, Dominique Perrin, Jean-Éric Pin
A survey on difference hierarchies of regular languages. Log. Methods Comput. Sci. 14 (1) (2018)
Olivier Carton, Luc Boasson
Transfinite Lyndon words. CoRR (2018)
Olivier Carton, Maurice Pouzet
Simon's Theorem for Scattered Words. DLT (2018)
Olivier Carton, Léo Exibard, Olivier Serre
Two-Way Two-Tape Automata. DLT (2017)
Nicolás Alvarez, Verónica Becher, Olivier Carton
Finite-state Independence and Normal Sequences. CoRR (2017)
Olivier Carton, Dominique Perrin, Jean-Éric Pin
A survey on difference hierarchies of regular languages. CoRR (2017)
Olivier Carton, Léo Exibard, Olivier Serre
Two-way Two-tape Automata. CoRR (2017)
Olivier Carton, Thomas Colcombet, Gabriele Puppis
Regular Languages of Words over Countable Linear Orderings. CoRR (2017)
Olivier Finkel, Olivier Carton, Dominique Lecomte
Polishness of some topologies related to automata (Extended version). CoRR (2017)
Michaël Cadilhac, Olivier Carton, Charles Paperman
Continuity and Rational Functions. ICALP (2017)
Olivier Carton, Olivier Finkel, Dominique Lecomte
Polishness of Some Topologies Related to Automata. CSL (2017)
Verónica Becher, Olivier Carton, Pablo Ariel Heiber
Finite-state independence. CoRR (2016)
Olivier Carton, Pablo Ariel Heiber
Normality and two-way automata. Inf. Comput. 241 (2015)
Verónica Becher, Olivier Carton, Pablo Ariel Heiber
Normality and automata. J. Comput. Syst. Sci. 81 (8) (2015)
Luc Boasson, Olivier Carton
Rational Selecting Relations and Selectors. LATA (2015)
Luc Boasson, Olivier Carton
Transfinite Lyndon Words. DLT (2015)
Olivier Carton, Luc Dartois
Aperiodic Two-way Transducers and FO-Transductions. CSL (2015)
Marie-Pierre Béal, Olivier Carton
Preface. Int. J. Found. Comput. Sci. 25 (8) (2014)
Achim Blumensath, Olivier Carton, Thomas Colcombet
Asymptotic Monadic Second-Order Logic. MFCS (1) (2014)
Béatrice Bérard, Olivier Carton
Channel Synthesis Revisited. LATA (2014)
Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen
An aperiodicity problem for multiwords. RAIRO Theor. Informatics Appl. 46 (1) (2012)
Olivier Carton
Two-Way Transducers with a Two-Way Output Tape. Developments in Language Theory (2012)
Olivier Carton, Thomas Colcombet, Gabriele Puppis
Regular Languages of Words over Countable Linear Orderings. ICALP (2) (2011)
Alexis Bès, Olivier Carton
Algebraic Characterization of FO for Scattered Linear Orderings. CSL (2011)
Sajid Zaidi, Frédéric Lamarque, Jérôme Favergeon, Olivier Carton, Christine Prelle
Wavelength-Selective Shape Memory Alloy for Wireless Microactuation of a Bistable Curved Beam. IEEE Trans. Ind. Electron. 58 (12) (2011)
Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal
Logic and Rational Languages of Words Indexed by Linear Orderings. Theory Comput. Syst. 46 (4) (2010)
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
Minimization of Automata CoRR (2010)
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo
The expressive power of the shuffle product. Inf. Comput. 208 (11) (2010)
Olivier Carton
Right-Sequential Functions on Infinite Words. CSR (2010)
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
Sturmian Trees. Theory Comput. Syst. 46 (3) (2010)
Olivier Carton
Left and Right Synchronous Relations. Developments in Language Theory (2009)
Olivier Carton, Jean-Éric Pin, Xaro Soler-Escrivà
Languages Recognized by Finite Supersoluble Groups. J. Autom. Lang. Comb. 14 (2) (2009)
Jean Berstel, Luc Boasson, Olivier Carton
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theor. Comput. Sci. 410 (30-32) (2009)
Véronique Bruyère, Olivier Carton, Géraud Sénizergues
Tree Automata and Automata on Linear Orderings. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
Infinite words without palindrome CoRR (2009)
Olivier Carton, Dominique Perrin, Jean-Eric Pin
Automata and semigroups recognizing infinite words. Logic and Automata (2008)
Olivier Carton, Olivier Finkel, Pierre Simonnet
On the Continuity Set of an omega Rational Function CoRR (2008)
Olivier Carton, Olivier Finkel, Pierre Simonnet
On the continuity set of an Omega rational function. RAIRO Theor. Informatics Appl. 42 (1) (2008)
Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal
Logic and Rational Languages of Words Indexed by Linear Orderings. CSR (2008)
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
A First Investigation of Sturmian Trees. STACS (2007)
Véronique Bruyère, Olivier Carton
Automata on linear orderings. J. Comput. Syst. Sci. 73 (1) (2007)
Olivier Carton, Chloe Rispal
Complementation of rational sets on scattered linear orderings of finite rank. Theor. Comput. Sci. 382 (2) (2007)
Olivier Carton
The growth ratio of synchronous rational relations is unique. Theor. Comput. Sci. 376 (1-2) (2007)
Olivier Carton, Christian Choffrut, Serge Grigorieff
Decision problems among the main subfamilies of rational relations. RAIRO Theor. Informatics Appl. 40 (2) (2006)
Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
Operations preserving regular languages. Theor. Comput. Sci. 354 (3) (2006)
Olivier Carton
The Growth Ratio of Synchronous Rational Relations Is Unique. Developments in Language Theory (2006)
Alexis Bès, Olivier Carton
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Int. J. Found. Comput. Sci. 17 (3) (2006)
Véronique Bruyère, Olivier Carton
Hierarchy Among Automata on Linear Orderings. Theory Comput. Syst. 38 (5) (2005)
Alexis Bès, Olivier Carton
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Developments in Language Theory (2005)
Chloe Rispal, Olivier Carton
Complementation of rational sets on countable scattered linear orderings. Int. J. Found. Comput. Sci. 16 (4) (2005)
Chloe Rispal, Olivier Carton
Complementation of Rational Sets on Countable Scattered Linear Orderings. Developments in Language Theory (2004)
Olivier Carton, Chloe Rispal
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank. LATIN (2004)
Jean Berstel, Olivier Carton
On the Complexity of Hopcroft's State Minimization Algorithm. CIAA (2004)
Marie-Pierre Béal, Olivier Carton
Determinization of Transducers over Infinite Words: The General Case. Theory Comput. Syst. 37 (4) (2004)
Olivier Carton
Unambiguous Automata on Bi-infinite Words. MFCS (2003)
Olivier Carton, Max Michel
Unambiguous Büchi automata. Theor. Comput. Sci. 297 (1-3) (2003)
Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
Operations Preserving Recognizable Languages. FCT (2003)
Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292 (1) (2003)
Véronique Bruyère, Olivier Carton
Hierarchy Among Automata on Linear Orderings. IFIP TCS (2002)
Véronique Bruyère, Olivier Carton
Automata on Linear Orderings. Developments in Language Theory (2002)
Olivier Carton
Accessibility in Automata on Scattered Linear Orderings. MFCS (2002)
Olivier Carton, Wolfgang Thomas
The Monadic Theory of Morphic Infinite Words and Generalizations. Inf. Comput. 176 (1) (2002)
Marie-Pierre Béal, Olivier Carton
Determinization of transducers over finite and infinite words. Theor. Comput. Sci. 289 (1) (2002)
Olivier Carton, Christian Choffrut
Periodicity and roots of transfinite strings. RAIRO Theor. Informatics Appl. 35 (6) (2001)
Véronique Bruyère, Olivier Carton
Automata on Linear Orderings. MFCS (2001)
Olivier Carton
R-Trivial Languages of Words on Countable Ordinals. Words, Languages & Combinatorics (2000)

Olivier Carton.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Olivier Carton