Olivier Carton

Cited by

	All	Since 2018
Citations	1610	534
h-index	22	13
i10-index	46	20

120

199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220236 8 14 9 6 3 17 16 33 49 43 56 81 76 61 81 66 74 85 59 72 72 59 101 92 116 80 74 71

Public access

View all

14 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Jean BerstelEmeritus Professor of Computer Science, Université Paris-EstVerified email at univ-mlv.fr
Veronique BruyereUniversity of MonsVerified email at umons.ac.be
dominique perrinProfessor of Computer Science, Universite Paris EstVerified email at univ-paris-est.fr
Verónica BecherUniversidad de Buenos Aires & CONICETVerified email at dc.uba.ar
Jean-Eric PinCNRSVerified email at liafa.univ-paris-diderot.fr
Pablo Ariel HeiberUniversidad de Buenos AiresVerified email at dc.uba.ar
Wolfgang ThomasProf of Computer Science, RWTH Aachen UniversityVerified email at cs.rwth-aachen.de
Gabriele PuppisDept. of Mathematics, Computer Science, and PhysicsVerified email at uniud.it
christian choffrutprofessor université Paris DiderotVerified email at irif.fr
Michaël CadilhacDePaul UniversityVerified email at cadilhac.name
Charles PapermanMaitre de Conférence à l'université de LilleVerified email at inria.fr
Antonio RestivoUniversità di PalermoVerified email at unipa.it
Nicolás Alejandro ÁlvarezInstituto de Ciencias de la Computación, FCEN-UBA/ConicetVerified email at dc.uba.ar
Bruno GuillonINRIA Lille Nord-EuropeVerified email at inria.fr
Fabian ReiterLIGM, Gustave Eiffel UniversityVerified email at univ-eiffel.fr
Achim BlumensathMasaryk University BrnoVerified email at mail.muni.cz
maurice pouzetuniversité Claude-Bernard Lyon1Verified email at univ-lyon1.fr
Olivier SerreIRIF (Université de Paris & CNRS)Verified email at cnrs.fr
Léo ExibardAssistant professor at LIGM, Université Gustave EiffelVerified email at univ-eiffel.fr
Jef WijsenProfessor of Computer Science, University of MonsVerified email at umons.ac.be

Olivier Carton

IRIF & Université de Paris

Verified email at irif.fr - Homepage

Theoretical computer science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Squaring transducers: an efficient procedure for deciding functionality and sequentiality MP Béal, O Carton, C Prieur, J Sakarovitch Theoretical Computer Science 292 (1), 45-63, 2003	120	2003
Unambiguous büchi automata O Carton, M Michel Theoretical Computer Science 297 (1-3), 37-81, 2003	81	2003
Langages formels, calculabilité et complexité O Carton Vuibert, 2008	78	2008
The monadic theory of morphic infinite words and generalizations O Carton, W Thomas Information and Computation 176 (1), 51-65, 2002	72	2002
Minimization of automata J Berstel, L Boasson, O Carton, I Fagnot arXiv preprint arXiv:1010.5318, 2010	60	2010
Determinization of transducers over finite and infinite words MP Béal, O Carton Theoretical Computer Science 289 (1), 225-251, 2002	54	2002
On the complexity of Hopcroft’s state minimization algorithm J Berstel, O Carton Implementation and Application of Automata: 9th International Conference …, 2005	52	2005
Automata on linear orderings V Bruyere, O Carton Mathematical Foundations of Computer Science 2001: 26th International …, 2001	51	2001
Automata on linear orderings V Bruyere, O Carton Journal of Computer and System Sciences 73 (1), 1-24, 2007	50	2007
Computing the Rabin index of a parity automaton O Carton, R Maceiras RAIRO-Theoretical Informatics and Applications 33 (6), 495-505, 1999	46	1999
The Wagner hierarchy O Carton, D Perrin International journal of algebra and computation 9 (05), 597-620, 1999	42	1999
Chains and superchains for ω-rational sets, automata and semigroups O Carton, D Perrin International Journal of Algebra and Computation 7 (06), 673-695, 1997	42	1997
Complementation of rational sets on countable scattered linear orderings C Rispal, O Carton International Journal of Foundations of Computer Science 16 (04), 767-786, 2005	35	2005
Aperiodic two-way transducers and FO-transductions O Carton, L Dartois arXiv preprint arXiv:2103.15651, 2021	33	2021
Decision problems among the main subfamilies of rational relations O Carton, C Choffrut, S Grigorieff RAIRO-Theoretical Informatics and Applications 40 (2), 255-275, 2006	31	2006
Squaring transducers: An efficient procedure for deciding functionality and sequentiality of transducers MP Béal, O Carton, C Prieur, J Sakarovitch LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del …, 2000	30	2000
An Eilenberg theorem for words on countable ordinals N Bedon, O Carton LATIN'98: Theoretical Informatics: Third Latin American Symposium Campinas …, 1998	30	1998
Normality and automata V Becher, O Carton, PA Heiber Journal of Computer and System Sciences 81 (8), 1592-1613, 2015	27	2015
Regular languages of words over countable linear orderings O Carton, T Colcombet, G Puppis International Colloquium on Automata, Languages, and Programming, 125-136, 2011	26	2011
Automata and semigroups recognizing infinite words. O Carton, D Perrin, JE Pin Logic and automata 2, 133-168, 2008	25	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors