Publications

Voici mon honnête contribution au bruit ambiant.

Copyright notice
List of my co-authors.

Book

  1. O. Carton, Langages formels, calculabilité et complexité. Vuibert, 2008.

Chapter of book

  1. O. Carton, J.-É. Pin, and D. Perrin, Logic and Automata, chapt. Automata and semigroups recognizing infinite words, pp. 133-167. Amsterdam University Press, 2007.

Articles

  1. V. Becher, O. Carton, and P.A. Heiber, Normality and automata, Journal of Computer and System Sciences, vol. 81, pp. 1592-1613, 2015.
  2. O. Carton and P.A. Heiber, Normality and two-way automata, Inf. Comput., vol. 241, pp. 264-276, 2015.
  3. J. Berstel, L. Boasson, O. Carton, J.-É. Pin, and A. Restivo, The expressive power of the shuffle product, Information and Computation, vol. 208, pp. 1258-1272, 2010.
  4. J. Berstel, L. Boasson, O. Carton, and I. Fagnot, Sturmian trees, TOCS, vol. 46, pp. 443-478, 2010.
  5. O. Carton, J.-É. Pin, and X. Soler-Escrivà, Languages recognized by finite supersoluble groups, Journal of Automata, Languages and Combinatorics, vol. 14, pp. 149-161, 2009.
  6. V. Bruyère, O. Carton, and G. Sénizergues, Tree automata and automata on linear orderings, Theoret. Informatics and Applications, vol. 43, no. 2, pp. 321-338, 2009.
  7. J. Berstel, L. Boasson, and O. carton, Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm, TCS, vol. 410, pp. 2811-2822, 2009.
  8. O. Carton, O. Finkel, and P. Simonnet, On the continuity of an omega rational function, RAIRO, vol. 42, no. 1, pp. 183-196, 2008.
  9. O. Carton, The growth ratio of synchronous rational relations is unique, Theoret. Comput. Sci., vol. 376, pp. 52-59, 2007.
  10. V. Bruyère and O. Carton, Automata on linear orderings, J. Comput. System Sci., vol. 73, no. 1, pp. 1-24, 2007.
  11. O. Carton, C. Choffrut, and S. Grigorieff, Decision problems among the main subfamilies of rational relations, Theoret. Informatics and Applications, vol. 40, pp. 255-275, 2006.
  12. A. Bès and O. Carton, A Kleene theorem for languages of words indexed by linear orderings, Int. J. Found. Comput. Sci., vol. 17, no. 3, pp. 519-542, 2006.
  13. J. Berstel, L. Boasson, O. Carton, B. Petazzoni, and J.-É. Pin, Operations preserving recognizable languages, Theoret. Comput. Sci., vol. 354, no. 3, pp. 405-420, 2006.
  14. C. Rispal and O. Carton, Complementation of rational sets on countable scattered linear orderings, J. Found. Comput. Sci., vol. 16, no. 4, pp. 767-786, 2005.
  15. V. Bruyère and O. Carton, Hierarchy among automata on linear orderings, Theory of Comput. systems, vol. 38, no. 5, pp. 593-621, 2005.
  16. M.-P. Béal and O. Carton, Determinization of transducers over infinite words: the general case, TOCS, vol. 37, no. 4, pp. 483-502, 2004.
  17. O. Carton and W. Thomas, The monadic theory of morphic infinite words and generalizations, Inform. Comput., vol. 176, pp. 51-76, 2002.
  18. M.-P. Béal, O. Carton, C. Prieur, and J. Sakarovitch, Squaring transducers: An efficient procedure for deciding functionality and sequentiality, Theoret. Comput. Sci., vol. 292, no. 1, pp. 45-63, 2003.
  19. O. Carton and M. Michel, Unambiguous Büchi automata, Theoret. Comput. Sci., vol. 297, pp. 37-81, 2003.
  20. M.-P. Béal and O. Carton, Determinization of transducers over finite and infinite words, Theoret. Comput. Sci., vol. 289, no. 1, pp. 225-251, 2002. IGM report 99-12.
  21. O. Carton, R-trivial languages of words on countable ordinals, Tech. Rep. 2001-05, Institut Gaspard Monge, 2001. To appear in TCS.
  22. O. Carton and C. Choffrut, Periodicity and roots of transfinite strings, Theoret. Informatics and Applications, vol. 35, no. 6, pp. 525-533, 2001.
  23. M.-P. Béal and O. Carton, Computing the prefix of an automaton, Theoret. Informatics and Applications, vol. 34, no. 6, pp. 503-514, 2000.
  24. M.-P. Béal and O. Carton, Asynchronous sliding block maps, Theoret. Informatics and Applications, vol. 34, pp. 139-156, 2000. IGM report 99-06.
  25. O. Carton and R. Maceiras, Computing the Rabin index of a parity automaton, Theoret. Informatics and Applications, vol. 33, pp. 495-505, 1999. IGM report 99-09.
  26. O. Carton, Wreath product and infinite words, J. Pure and Applied Algebra, vol. 153, pp. 129-150, 2000.
  27. O. Carton, A hierarchy of cyclic languages, Theoret. Informatics and Applications, vol. 31, no. 4, pp. 355-369, 1997.
  28. O. Carton and D. Perrin, The Wagner hierarchy of ω-rational sets, Int. J. Alg. Comput., vol. 9, no. 5, pp. 597-620, 1999.
  29. O. Carton and D. Perrin, Chains and superchains for ω-rational sets, automata and semigroups, Int. J. Alg. Comput., vol. 7, no. 7, pp. 673-695, 1997.
  30. O. Carton, Chain automata, Theoret. Comput. Sci., vol. 161, pp. 191-203, 1996. Report LITP 94-02.

Conferences

  1. L. Boasson and O. Carton, Transfinite lyndon words, in DLT'2015, pp. 179-190, 2015.
  2. O. Carton and L. Dartois, Aperiodic two-way transducers and FO-transductions, in CSL'2015, pp. 160-174, 2015.
  3. L. Boasson and O. Carton, Rational selecting relations and selectors, in LATA'2015, vol. 8977 of Lecture Notes in Computer Science, pp. 716-726, Springer, 2015.
  4. A. Blumensath, O. Carton, and T. Colcombet, Asymptotic monadic second-order logic, in MFCS'2014, vol. 8634 of Lecture Notes in Computer Science, pp. 87-98, Springer, 2014.
  5. B. Bérard and O. Carton, Channel synthesis revisited, in LATA'2014, vol. 8370 of Lecture Notes in Computer Science, pp. 149-160, Springer, 2014.
  6. O. Carton, T. Colcombet, and G. Puppis, Regular languages of words over countable linear orderings, in ICALP (2), vol. 6756 of Lect. Notes in Comput. Sci., pp. 125-136, Springer, 2011.
  7. A. Bès and O. Carton, Algebraic characterization of FO for scattered linear orderings, in CSL'2011, vol. 12 of LIPIcs, pp. 67-81, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011.
  8. O. Carton, Right sequential functions on infinite words, in CSR'2010, 2010.
  9. O. Carton, Left and right synchrounous relations, in DLT'2009, vol. 5583 of Lect. Notes in Comput. Sci., pp. 170-182, Springer-Verlag, 2009.
  10. J. Berstel, L. Boasson, and O. Carton, Hopcroft's automaton minimization algorithm and sturmian words, in DMTCS'2008 (Fifth Colloquium on Mathematics and Computer Science, vol. AI of DMTCS proceedings series, pp. 355-366, 2008.
  11. N. Bedon, A. Bès, O. Carton, and C. Rispal, Logic and rational languages of words indexed by linear orderings, in CSR'2008, vol. 5010 of Lect. Notes in Comput. Sci., pp. 78-85, Springer-Verlag, 2008.
  12. J. Berstel, L. Boasson, O. Carton, and I. Fagnot, A first investigation of Sturmian trees, in STACS'2007 (W. Thomas and P. Weil, eds.), vol. 4393 of Lect. Notes in Comput. Sci., pp.
  13. O. Carton, The growth ratio of synchronous rational relations is unique, in DLT'2006 (O. H. Ibarra and Z. Dang, eds.), vol. 4036 of Lect. Notes in Comput. Sci., pp. 270-279, Springer-Verlag, 2006.
  14. A. Bès and O. Carton, A Kleene theorem for languages of words indexed by linear orderings, in DLT'2005 (C. de Felice and A. Restivo, eds.), vol. 3572 of Lect. Notes in Comput. Sci., pp. 158-167, Springer-Verlag, 2005.
  15. C. Rispal and O. Carton, Complementation of rational sets on countable scattered linear orderings, in DLT'2004 (C. S. Calude, E. Calude, and M. J. Dinneen, eds.), vol. 3340 of Lect. Notes in Comput. Sci., pp. 381-392, Springer-Verlag, 2004.
  16. J. Berstel and O. Carton, On the complexity of hopcroft's state minimization algorithm, in CIAA'2004, vol. 3317 of Lect. Notes in Comput. Sci., pp. 35-44, Springer-Verlag, 2004.
  17. O. Carton and C. Rispal, Complementation of rational sets on scattered linear orderings of finite rank, in LATIN'2004, vol. 2976 of Lect. Notes in Comput. Sci., pp. 292-301, 2004.
  18. V. Bruyère, O. Carton, and G. Sénizergues, Tree automata and automata on linear orderings, in WORDS'2003 (T. Harju and J. Karhumäki, eds.), pp. 222-231, Turku Center for Computer Science, 2003.
  19. O. Carton, Unambiguous automata on bi-infinite words, in MFCS'2003 (B. Rovan and P. Vojtáš, eds.), vol. 2747 of Lect. Notes in Comput. Sci., pp. 308-317, 2003.
  20. J. Berstel, L. Boasson, O. Carton, B. Petazzoni, and J.-E. Pin, Operations preserving recognizable languages, in FCT'2003 (A. Lingas and B. J. Nilsson, eds.), vol. 2751 of Lect. Notes in Comput. Sci., pp. 343-354, 2003.
  21. V. Bruyère and O. Carton, Automata on linear orderings, in DLT'2002 (M. Ito and M. Toyama, eds.), vol. 2450 of Lect. Notes in Comput. Sci., pp. 103-115, 2002.
  22. O. Carton, Accessibility in automata on scattered linear orderings, in MFCS'2002 (K. Diks and W. Rytter, eds.), vol. 2420 of Lect. Notes in Comput. Sci., pp. 155-164, 2002.
  23. V. Bruyère and O. Carton, Hierarchy among automata on linear orderings, in Foudation of Information technology in the era of network and mobile computing (R. Baeza-Yates, U. Montanari, and N. Santoro, eds.), pp. 107-118, Kluwer Academic Publishers, 2002. TCS'2002/IFIP'2002.
  24. V. Bruyère and O. Carton, Automata on linear orderings, in MFCS'2001 (J. Sgall, A. Pultr, and P. Kolman, eds.), vol. 2136 of Lect. Notes in Comput. Sci., pp. 236-247, 2001.
  25. O. Carton and W. Thomas, The monadic theory of morphic infinite words and generalizations, in MFCS'2000 (M. Nielsen and B. Rovan, eds.), no. 1893 in Lect. Notes in Comput. Sci., pp. 275-284, 2000.
  26. M.-P. Béal and O. Carton, Determinization of transducers over infinite words, in ICALP'2000 (U. Montanari et al., eds.), vol. 1853 of Lect. Notes in Comput. Sci., pp. 561-570, 2000.
  27. M.-P. Béal, O. Carton, C. Prieur, and J. Sakarovitch, Squaring transducers: An efficient procedure for deciding functionality and sequentiality, in LATIN'2000 (G. Gonnet, D. Panario, and A. Viola, eds.), vol. 1776 of Lect. Notes in Comput. Sci., pp. 397-406, 2000.
  28. O. Carton and M. Michel, Unambiguous Büchi automata, in LATIN'2000 (G. Gonnet, D. Panario, and A. Viola, eds.), vol. 1776 of Lect. Notes in Comput. Sci., pp. 407-416, 2000.
  29. M.-P. Béal and O. Carton, Asynchronous sliding block maps, in Developments in Language Theory (G. Rozenberg and W. Thomas, eds.), pp. 47-59, World Scientific, 1999. IGM report 99-06.
  30. N. Bedon and O. Carton, An Eilenberg theorem for words on countable ordinals, in Latin'98: Theoretical Informatics (C. L. Lucchesi and A. V. Moura, eds.), vol. 1380 of Lect. Notes in Comput. Sci., pp. 53-64, Springer-Verlag, 1998.
  31. O. Carton and D. Perrin, The Wadge-Wagner hierarchy of ω-rational sets, in Automata, Languages and Programming (P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, eds.), vol. 1256 of Lect. Notes in Comput. Sci., pp. 17-35, Springer-Verlag, 1997.
  32. O. Carton and D. Perrin, Chains and superchains in ω-semigroups, in Semigroups, Automata and Languages (J. Almeida, G. Gomes, and P. Silva, eds.), pp. 17-28, World Scientific, 1994.
  33. M.-P. Béal, O. Carton, and C. Reutenauer, Cyclic languages and strongly cyclic languages, in STACS '96, vol. 1046 of Lect. Notes in Comput. Sci., pp. 49-59, 1996.
  34. O. Carton, Chain automata, in IFIP World Computer Congress '94, (Hamburg), pp. 451-458, Elsevier (North-Holland), 1994.

Miscellaneous

  1. O. Carton, Automates et mots infinis. Habilitation à Diriger des Recherches, Université de Marne-la-Vallée, 2001.
  2. O. Carton, Mots infinis, ω-semigroupes et topologie. Thèse de doctorat, Université Paris 7, 1993. Report LITP-TH 93-08.
  3. O. Carton, Étude de la thèse de Hing Leung, rapport de DEA, Université Paris 7, 1988. Report LITP 88.

BibTeX