Olivier Carton

Most-cited papers

Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Marie-Pierre Béal, Olivier Carton, Christophe Prieur, J. Sakarovitch
2000Theoretical Computer Science101 citations Open access
Semantic Scholar
The Monadic Theory of Morphic Infinite Words and Generalizations
Olivier Carton, W. Thomas
2000Information and Computation77 citations Open access
Semantic Scholar
Automata on linear orderings
V. Bruyère, Olivier Carton
2001Journal of computer and system sciences (Print)69 citations Open access
Semantic Scholar
Unambiguous Büchi automata
Olivier Carton, M. Michel
2000Theoretical Computer Science65 citations Open access
Semantic Scholar
On the Complexity of Hopcroft's State Minimization Algorithm
J. Berstel, Olivier Carton
2004International Conference on Implementation and Application of Automata43 citations
Semantic Scholar
Determinization of transducers over finite and infinite words
Marie-Pierre Béal, Olivier Carton
2002Theoretical Computer Science42 citations Open access
Semantic Scholar
Computing the Rabin Index of a Parity Automaton
Olivier Carton, Ramón Maceiras
1999RAIRO - Theoretical Informatics and Applications42 citations
Semantic Scholar
Minimization of Automata
J. Berstel, L. Boasson, Olivier Carton, Isabelle J. Fagnot
2010arXiv.org41 citations
Semantic Scholar
Chains and Superchains for ω-Rational Sets, Automata and Semigroups
Olivier Carton, D. Perrin
1997International journal of algebra and computation39 citations
Semantic Scholar
Complementation of rational sets on countable scattered linear orderings
C. Rispal, Olivier Carton
2004International Journal of Foundations of Computer Science38 citations Open access
Semantic Scholar
Aperiodic Two-way Transducers and FO-Transductions
Olivier Carton, L. Dartois
2021Annual Conference for Computer Science Logic32 citations
Semantic Scholar
An Eilenberg Theorem for Words on Countable Ordinals
Nicolas Bedon, Olivier Carton
1998Latin American Symposium on Theoretical Informatics32 citations
Semantic Scholar
Decision problems among the main subfamilies of rational relations
Olivier Carton, C. Choffrut, S. Grigorieff
2006RAIRO - Theoretical Informatics and Applications31 citations
Semantic Scholar
Normality and automata
V. Becher, Olivier Carton, Pablo Ariel Heiber
2015Journal of computer and system sciences (Print)25 citations Open access
Semantic Scholar
Regular Languages of Words over Countable Linear Orderings
Olivier Carton, Thomas Colcombet, G. Puppis
2011International Colloquium on Automata, Languages and Programming24 citations Open access
Semantic Scholar
Accessibility in Automata on Scattered Linear Orderings
Olivier Carton
2002International Symposium on Mathematical Foundations of Computer Science21 citations
Semantic Scholar
Automata and semigroups recognizing infinite words
Olivier Carton, D. Perrin, J. Pin
2008Logic and Automata20 citations
Semantic Scholar
A Kleene Theorem for Languages of Words Indexed by Linear Orderings
A. Bès, Olivier Carton
2005International Journal of Foundations of Computer Science20 citations Open access
Semantic Scholar
Author's Personal Copy Information and Computation the Expressive Power of the Shuffle Product <
J. Berstel, L. Boasson, Olivier Carton, J. Pin +1 more
20 citations
Semantic Scholar
Normal Numbers and Computer Science
V. Becher, Olivier Carton
201819 citations
Semantic Scholar
A First Investigation of Sturmian Trees
J. Berstel, L. Boasson, Olivier Carton, Isabelle J. Fagnot
2007Symposium on Theoretical Aspects of Computer Science18 citations Open access
Semantic Scholar
Determinization of Transducers over Infinite Words: The General Case
Marie-Pierre Béal, Olivier Carton
2000Theory of Computing Systems17 citations Open access
Semantic Scholar
Normal numbers and nested perfect necklaces
V. Becher, Olivier Carton
2018Journal of Complexity16 citations Open access
Semantic Scholar
Finite-State Independence
V. Becher, Olivier Carton, Pablo Ariel Heiber
2016Theory of Computing Systems16 citations
Semantic Scholar
Operations Preserving Recognizable Languages
J. Berstel, L. Boasson, Olivier Carton, Bruno Petazzoni +1 more
2003International Symposium on Fundamentals of Computation Theory16 citations Open access
Semantic Scholar
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
J. Berstel, L. Boasson, Olivier Carton
2009Theoretical Computer Science15 citations Open access
Semantic Scholar
Computing the prefix of an automaton
Marie-Pierre Béal, Olivier Carton
2000RAIRO - Theoretical Informatics and Applications15 citations Open access
Semantic Scholar
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers
Marie-Pierre Béal, Olivier Carton, Christophe Prieur, J. Sakarovitch
2000Latin American Symposium on Theoretical Informatics15 citations
Semantic Scholar
Infinite words without palindrome
J. Berstel, L. Boasson, Olivier Carton, Isabelle J. Fagnot
2009arXiv.org14 citations
Semantic Scholar
Logic and Rational Languages of Words Indexed by Linear Orderings
Nicolas Bedon, A. Bès, Olivier Carton, C. Rispal
2008Computer Science Symposium in Russia14 citations
Semantic Scholar
Operations preserving regular languages
J. Berstel, L. Boasson, Olivier Carton, Bruno Petazzoni +1 more
2006Theoretical Computer Science14 citations Open access
Semantic Scholar
Complementation of rational sets on scattered linear orderings of finite rank
Olivier Carton, C. Rispal
2004Theoretical Computer Science14 citations Open access
Semantic Scholar
The Wagner Hierarchy
Olivier Carton, D. Perrin
1999International journal of algebra and computation14 citations
Semantic Scholar
AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS
Olivier Carton, Thomas Colcombet, G. Puppis
2017Journal of Symbolic Logic (JSL)13 citations Open access
Semantic Scholar
Normality and two-way automata
Olivier Carton, Pablo Ariel Heiber
2015Information and Computation13 citations Open access
Semantic Scholar
Sturmian Trees
J. Berstel, L. Boasson, Olivier Carton, Isabelle J. Fagnot
2010Theory of Computing Systems13 citations
Semantic Scholar
Logic and Rational Languages of Words Indexed by Linear Orderings
Nicolas Bedon, A. Bès, Olivier Carton, C. Rispal
2010Theory of Computing Systems12 citations
Semantic Scholar
Hopcroft's automaton minimization algorithm and Sturmian words
J. Berstel, L. Boasson, Olivier Carton
200812 citations
Semantic Scholar
Hierarchy Among Automata on Linear Orderings
V. Bruyère, Olivier Carton
2002Theory of Computing Systems11 citations Open access
Semantic Scholar
Chain Automata
Olivier Carton
1996Theoretical Computer Science11 citations Open access
Semantic Scholar
Wreath product and infinite words
Olivier Carton
200010 citations Open access
Semantic Scholar
Cyclic Languages and Strongly Cyclic Languages
Marie-Pierre Béal, Olivier Carton, C. Reutenauer
1996Symposium on Theoretical Aspects of Computer Science10 citations Open access
Semantic Scholar
The growth ratio of synchronous rational relations is unique
Olivier Carton
2006Theoretical Computer Science9 citations Open access
Semantic Scholar
Right-Sequential Functions on Infinite Words
Olivier Carton
2010Computer Science Symposium in Russia8 citations
Semantic Scholar
Low discrepancy sequences failing Poissonian pair correlations
V. Becher, Olivier Carton, Ignacio Mollo Cunningham
2019Archiv der Mathematik7 citations Open access
Semantic Scholar
Algebraic Characterization of FO for Scattered Linear Orderings
A. Bès, Olivier Carton
2011Annual Conference for Computer Science Logic7 citations Open access
Semantic Scholar
Tree Automata and Automata on Linear Orderings
V. Bruyère, Olivier Carton, G. Sénizergues
2009RAIRO - Theoretical Informatics and Applications7 citations
Semantic Scholar
Counter Machines and Distributed Automata: A Story about Exchanging Space and Time
Olivier Carton, Bruno Guillon, Fabian Reiter
2018International Workshop on Cellular Automata and Discrete Complex Systems6 citations Open access
Semantic Scholar
Transfinite Lyndon Words
Olivier Carton, L. Boasson
2015International Conference on Developments in Language Theory6 citations Open access
Semantic Scholar
Asymptotic Monadic Second-Order Logic
Achim Blumensath, Olivier Carton, Thomas Colcombet
2014International Symposium on Mathematical Foundations of Computer Science6 citations
Semantic Scholar