Olivier Carton

Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen: An aperiodicity problem for multiwords. RAIRO - Theor. Inf. and Applic. 46(1): 33-50 (2012)

Olivier Carton: Two-Way Transducers with a Two-Way Output Tape. Developments in Language Theory 2012: 263-272

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 Transactions on Industrial Electronics 58(12): 5288-5295 (2011)

Alexis Bès, Olivier Carton: Algebraic Characterization of FO for Scattered Linear Orderings. CSL 2011: 67-81

Olivier Carton, Thomas Colcombet, Gabriele Puppis: Regular Languages of Words over Countable Linear Orderings. ICALP (2) 2011: 125-136

Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo: The expressive power of the shuffle product. Inf. Comput. 208(11): 1258-1272 (2010)

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: Sturmian Trees. Theory Comput. Syst. 46(3): 443-478 (2010)

Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal: Logic and Rational Languages of Words Indexed by Linear Orderings. Theory Comput. Syst. 46(4): 737-760 (2010)

Olivier Carton: Right-Sequential Functions on Infinite Words. CSR 2010: 96-106

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: Minimization of Automata. CoRR abs/1010.5318 (2010)

Véronique Bruyère, Olivier Carton, Géraud Sénizergues: Tree Automata and Automata on Linear Orderings. ITA 43(2): 321-338 (2009)

Olivier Carton, Jean-Éric Pin, Xaro Soler-Escrivà: Languages Recognized by Finite Supersoluble Groups. Journal of Automata, Languages and Combinatorics 14(2): 149-161 (2009)

Jean Berstel, Luc Boasson, Olivier Carton: Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theor. Comput. Sci. 410(30-32): 2811-2822 (2009)

Olivier Carton: Left and Right Synchronous Relations. Developments in Language Theory 2009: 170-182

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: Infinite words without palindrome. CoRR abs/0903.2382 (2009)

Olivier Carton, Olivier Finkel, Pierre Simonnet: On the continuity set of an Omega rational function. ITA 42(1): 183-196 (2008)

Olivier Carton, Dominique Perrin, Jean-Eric Pin: Automata and semigroups recognizing infinite words. Logic and Automata 2008: 133-168

Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal: Logic and Rational Languages of Words Indexed by Linear Orderings. CSR 2008: 76-85

Olivier Carton, Olivier Finkel, Pierre Simonnet: On the Continuity Set of an omega Rational Function. CoRR abs/0801.3912 (2008)

Véronique Bruyère, Olivier Carton: Automata on linear orderings. J. Comput. Syst. Sci. 73(1): 1-24 (2007)

Olivier Carton: The growth ratio of synchronous rational relations is unique. Theor. Comput. Sci. 376(1-2): 52-59 (2007)

Olivier Carton, Chloe Rispal: Complementation of rational sets on scattered linear orderings of finite rank. Theor. Comput. Sci. 382(2): 109-119 (2007)

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: A First Investigation of Sturmian Trees. STACS 2007: 73-84

Alexis Bès, Olivier Carton: A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Int. J. Found. Comput. Sci. 17(3): 519-542 (2006)

Olivier Carton, Christian Choffrut, Serge Grigorieff: Decision problems among the main subfamilies of rational relations. ITA 40(2): 255-275 (2006)

Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin: Operations preserving regular languages. Theor. Comput. Sci. 354(3): 405-420 (2006)

Olivier Carton: The Growth Ratio of Synchronous Rational Relations Is Unique. Developments in Language Theory 2006: 270-279

Chloe Rispal, Olivier Carton: Complementation of rational sets on countable scattered linear orderings. Int. J. Found. Comput. Sci. 16(4): 767-786 (2005)

Véronique Bruyère, Olivier Carton: Hierarchy Among Automata on Linear Orderings. Theory Comput. Syst. 38(5): 593-621 (2005)

Alexis Bès, Olivier Carton: A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Developments in Language Theory 2005: 158-167

Marie-Pierre Béal, Olivier Carton: Determinization of Transducers over Infinite Words: The General Case. Theory Comput. Syst. 37(4): 483-502 (2004)

Chloe Rispal, Olivier Carton: Complementation of Rational Sets on Countable Scattered Linear Orderings. Developments in Language Theory 2004: 381-392

Olivier Carton, Chloe Rispal: Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank. LATIN 2004: 292-301

Jean Berstel, Olivier Carton: On the Complexity of Hopcroft's State Minimization Algorithm. CIAA 2004: 35-44

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): 45-63 (2003)

Olivier Carton, Max Michel: Unambiguous Büchi automata. Theor. Comput. Sci. 297(1-3): 37-81 (2003)

Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin: Operations Preserving Recognizable Languages. FCT 2003: 343-354

Olivier Carton: Unambiguous Automata on Bi-infinite Words. MFCS 2003: 308-317

Olivier Carton, Wolfgang Thomas: The Monadic Theory of Morphic Infinite Words and Generalizations. Inf. Comput. 176(1): 51-65 (2002)

Marie-Pierre Béal, Olivier Carton: Determinization of transducers over finite and infinite words. Theor. Comput. Sci. 289(1): 225-251 (2002)

Véronique Bruyère, Olivier Carton: Automata on Linear Orderings. Developments in Language Theory 2002: 103-115

Véronique Bruyère, Olivier Carton: Hierarchy Among Automata on Linear Orderings. IFIP TCS 2002: 107-118

Olivier Carton: Accessibility in Automata on Scattered Linear Orderings. MFCS 2002: 155-164

Olivier Carton, Christian Choffrut: Periodicity and roots of transfinite strings. ITA 35(6): 525-533 (2001)

Véronique Bruyère, Olivier Carton: Automata on Linear Orderings. MFCS 2001: 236-247

Marie-Pierre Béal, Olivier Carton: Asynchronous sliding block maps. ITA 34(2): 139-156 (2000)

Marie-Pierre Béal, Olivier Carton: Computing the prefix of an automaton. ITA 34(6): 503-514 (2000)

Olivier Carton: R-Trivial Languages of Words on Countable Ordinals. Words, Languages & Combinatorics 2000: 88-102

Marie-Pierre Béal, Olivier Carton: Determinization of Transducers over Infinite Words. ICALP 2000: 561-570

Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch: Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. LATIN 2000: 397-406

Olivier Carton, Max Michel: Unambiguous Büchi Automata. LATIN 2000: 407-416

Olivier Carton, Wolfgang Thomas: The Monadic Theory of Morphic Infinite Words and Generalizations. MFCS 2000: 275-284

Olivier Carton, Dominique Perrin: The Wagner Hierarchy. IJAC 9(5): 597-620 (1999)

Olivier Carton, Ramón Maceiras: Computing the Rabin Index of a Parity Automaton. ITA 33(6): 495-506 (1999)

Marie-Pierre Béal, Olivier Carton: Asynchronous sliding block maps. Developments in Language Theory 1999: 47-59

Nicolas Bedon, Olivier Carton: An Eilenberg Theorem for Words on Countable Ordinals. LATIN 1998: 53-64

Olivier Carton: A Hierarchy of Cyclic Languages. ITA 31(4): 355-369 (1997)

Olivier Carton, Dominique Perrin: The Wadge-Wagner Hierarchy of omega-Rational Sets. ICALP 1997: 17-35

Olivier Carton: Chain Automata. Theor. Comput. Sci. 161(1&2): 191-203 (1996)

Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer: Cyclic Languages and Strongly Cyclic Languages. STACS 1996: 49-59

Olivier Carton: Chain Automata. IFIP Congress (1) 1994: 451-458