Olivier Carton
Olivier Carton
IRIF & Université de Paris
Verified email at irif.fr - Homepage
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
1142003
Langages formels, calculabilité et complexité
O Carton
Vuibert, 2008
702008
The monadic theory of morphic infinite words and generalizations
O Carton, W Thomas
Information and Computation 176 (1), 51-65, 2002
642002
Unambiguous büchi automata
O Carton, M Michel
Theoretical Computer Science 297 (1-3), 37-81, 2003
602003
Minimization of automata
J Berstel, L Boasson, O Carton, I Fagnot
arXiv preprint arXiv:1010.5318, 2010
532010
On the complexity of Hopcroft’s state minimization algorithm
J Berstel, O Carton
International Conference on Implementation and Application of Automata, 35-44, 2004
512004
Determinization of transducers over finite and infinite words
MP Béal, O Carton
Theoretical computer science 289 (1), 225-251, 2002
512002
Automata on linear orderings
V Bruyere, O Carton
International Conference on Developments in Language Theory, 103-115, 2002
492002
Automata on linear orderings
V Bruyere, O Carton
Journal of Computer and System Sciences 73 (1), 1-24, 2007
462007
Chains and superchains for ω-rational sets, automata and semigroups
O Carton, D Perrin
International Journal of Algebra and Computation 7 (06), 673-695, 1997
401997
The Wagner hierarchy
O Carton, D Perrin
International journal of algebra and computation 9 (05), 597-620, 1999
391999
Highly efficient photocatalytic TiO2 coatings deposited by open air atmospheric pressure plasma jet with aerosolized TTIP precursor
H Fakhouri, DB Salem, O Carton, J Pulpytel, F Arefi-Khonsari
Journal of Physics D: Applied Physics 47 (26), 265301, 2014
382014
Computing the Rabin index of a parity automaton
O Carton, R Maceiras
RAIRO-Theoretical Informatics and Applications 33 (6), 495-505, 1999
341999
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
332005
Squaring transducers: An efficient procedure for deciding functionality and sequentiality of transducers
MP Béal, O Carton, C Prieur, J Sakarovitch
Latin American Symposium on Theoretical Informatics, 397-406, 2000
282000
Aperiodic two-way transducers and FO-transductions
O Carton, L Dartois
arXiv preprint arXiv:2103.15651, 2021
272021
An Eilenberg theorem for words on countable ordinals
N Bedon, O Carton
Latin American Symposium on Theoretical Informatics, 53-64, 1998
271998
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
262006
Normality and automata
V Becher, O Carton, PA Heiber
Journal of Computer and System Sciences 81 (8), 1592-1613, 2015
232015
Accessibility in automata on scattered linear orderings
O Carton
International Symposium on Mathematical Foundations of Computer Science, 155-164, 2002
232002
The system can't perform the operation now. Try again later.
Articles 1–20