| 2009 |
|---|
| 42 | EE | Jean Berstel,
Luc Boasson,
Olivier Carton,
Isabelle Fagnot:
Infinite words without palindrome
CoRR abs/0903.2382: (2009) |
| 2008 |
|---|
| 41 | EE | Nicolas Bedon,
Alexis Bès,
Olivier Carton,
Chloe Rispal:
Logic and Rational Languages of Words Indexed by Linear Orderings.
CSR 2008: 76-85 |
| 40 | EE | Olivier Carton,
Olivier Finkel,
Pierre Simonnet:
On the Continuity Set of an omega Rational Function
CoRR abs/0801.3912: (2008) |
| 2007 |
|---|
| 39 | EE | Jean Berstel,
Luc Boasson,
Olivier Carton,
Isabelle Fagnot:
A First Investigation of Sturmian Trees.
STACS 2007: 73-84 |
| 38 | EE | Véronique Bruyère,
Olivier Carton:
Automata on linear orderings.
J. Comput. Syst. Sci. 73(1): 1-24 (2007) |
| 37 | EE | Olivier Carton:
The growth ratio of synchronous rational relations is unique.
Theor. Comput. Sci. 376(1-2): 52-59 (2007) |
| 36 | EE | Olivier Carton,
Chloe Rispal:
Complementation of rational sets on scattered linear orderings of finite rank.
Theor. Comput. Sci. 382(2): 109-119 (2007) |
| 2006 |
|---|
| 35 | EE | Olivier Carton:
The Growth Ratio of Synchronous Rational Relations Is Unique.
Developments in Language Theory 2006: 270-279 |
| 34 | EE | 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) |
| 33 | EE | Jean Berstel,
Luc Boasson,
Olivier Carton,
Bruno Petazzoni,
Jean-Eric Pin:
Operations preserving regular languages.
Theor. Comput. Sci. 354(3): 405-420 (2006) |
| 2005 |
|---|
| 32 | EE | Alexis Bès,
Olivier Carton:
A Kleene Theorem for Languages of Words Indexed by Linear Orderings.
Developments in Language Theory 2005: 158-167 |
| 31 | EE | Chloe Rispal,
Olivier Carton:
Complementation of rational sets on countable scattered linear orderings.
Int. J. Found. Comput. Sci. 16(4): 767-786 (2005) |
| 30 | EE | Véronique Bruyère,
Olivier Carton:
Hierarchy Among Automata on Linear Orderings.
Theory Comput. Syst. 38(5): 593-621 (2005) |
| 2004 |
|---|
| 29 | EE | Jean Berstel,
Olivier Carton:
On the Complexity of Hopcroft's State Minimization Algorithm.
CIAA 2004: 35-44 |
| 28 | EE | Chloe Rispal,
Olivier Carton:
Complementation of Rational Sets on Countable Scattered Linear Orderings.
Developments in Language Theory 2004: 381-392 |
| 27 | EE | Olivier Carton,
Chloe Rispal:
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank.
LATIN 2004: 292-301 |
| 26 | EE | Marie-Pierre Béal,
Olivier Carton:
Determinization of Transducers over Infinite Words: The General Case.
Theory Comput. Syst. 37(4): 483-502 (2004) |
| 2003 |
|---|
| 25 | EE | Jean Berstel,
Luc Boasson,
Olivier Carton,
Bruno Petazzoni,
Jean-Eric Pin:
Operations Preserving Recognizable Languages.
FCT 2003: 343-354 |
| 24 | EE | Olivier Carton:
Unambiguous Automata on Bi-infinite Words.
MFCS 2003: 308-317 |
| 23 | | 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) |
| 22 | EE | Olivier Carton,
Max Michel:
Unambiguous Büchi automata.
Theor. Comput. Sci. 297(1-3): 37-81 (2003) |
| 2002 |
|---|
| 21 | EE | Véronique Bruyère,
Olivier Carton:
Automata on Linear Orderings.
Developments in Language Theory 2002: 103-115 |
| 20 | | Véronique Bruyère,
Olivier Carton:
Hierarchy Among Automata on Linear Orderings.
IFIP TCS 2002: 107-118 |
| 19 | EE | Olivier Carton:
Accessibility in Automata on Scattered Linear Orderings.
MFCS 2002: 155-164 |
| 18 | EE | Olivier Carton,
Wolfgang Thomas:
The Monadic Theory of Morphic Infinite Words and Generalizations.
Inf. Comput. 176(1): 51-65 (2002) |
| 17 | | Marie-Pierre Béal,
Olivier Carton:
Determinization of transducers over finite and infinite words.
Theor. Comput. Sci. 289(1): 225-251 (2002) |
| 2001 |
|---|
| 16 | EE | Véronique Bruyère,
Olivier Carton:
Automata on Linear Orderings.
MFCS 2001: 236-247 |
| 15 | EE | Olivier Carton,
Christian Choffrut:
Periodicity and roots of transfinite strings.
ITA 35(6): 525-533 (2001) |
| 2000 |
|---|
| 14 | EE | Marie-Pierre Béal,
Olivier Carton:
Determinization of Transducers over Infinite Words.
ICALP 2000: 561-570 |
| 13 | | 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 |
| 12 | | Olivier Carton,
Max Michel:
Unambiguous Büchi Automata.
LATIN 2000: 407-416 |
| 11 | EE | Olivier Carton,
Wolfgang Thomas:
The Monadic Theory of Morphic Infinite Words and Generalizations.
MFCS 2000: 275-284 |
| 10 | | Marie-Pierre Béal,
Olivier Carton:
Asynchronous sliding block maps.
ITA 34(2): 139-156 (2000) |
| 9 | EE | Marie-Pierre Béal,
Olivier Carton:
Computing the prefix of an automaton.
ITA 34(6): 503-514 (2000) |
| 1999 |
|---|
| 8 | | Marie-Pierre Béal,
Olivier Carton:
Asynchronous sliding block maps.
Developments in Language Theory 1999: 47-59 |
| 7 | | Olivier Carton,
Ramón Maceiras:
Computing the Rabin Index of a Parity Automaton.
ITA 33(6): 495-506 (1999) |
| 1998 |
|---|
| 6 | EE | Nicolas Bedon,
Olivier Carton:
An Eilenberg Theorem for Words on Countable Ordinals.
LATIN 1998: 53-64 |
| 1997 |
|---|
| 5 | | Olivier Carton,
Dominique Perrin:
The Wadge-Wagner Hierarchy of omega-Rational Sets.
ICALP 1997: 17-35 |
| 4 | | Olivier Carton:
A Hierarchy of Cyclic Languages.
ITA 31(4): 355-369 (1997) |
| 1996 |
|---|
| 3 | | Marie-Pierre Béal,
Olivier Carton,
Christophe Reutenauer:
Cyclic Languages and Strongly Cyclic Languages.
STACS 1996: 49-59 |
| 2 | EE | Olivier Carton:
Chain Automata.
Theor. Comput. Sci. 161(1&2): 191-203 (1996) |
| 1994 |
|---|
| 1 | | Olivier Carton:
Chain Automata.
IFIP Congress (1) 1994: 451-458 |
