| 2008 |
|---|
| 41 | EE | Sylvain Lavallée,
Christophe Reutenauer,
Vladimir Retakh,
Dominique Perrin:
Codes and Noncommutative Stochastic Matrices
CoRR abs/0808.4100: (2008) |
| 40 | EE | Valérie Berthé,
Aldo de Luca,
Christophe Reutenauer:
On an involution of Christoffel words and Sturmian morphisms.
Eur. J. Comb. 29(2): 535-553 (2008) |
| 39 | EE | Jean Berstel,
Christophe Reutenauer:
Another proof of Soittola's theorem.
Theor. Comput. Sci. 393(1-3): 196-203 (2008) |
| 38 | EE | Jean Berstel,
Christophe Reutenauer:
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids.
Theor. Comput. Sci. 400(1-3): 144-158 (2008) |
| 37 | EE | Christian Kassel,
Christophe Reutenauer:
A palindromization map for the free group.
Theor. Comput. Sci. 409(3): 461-470 (2008) |
| 2007 |
|---|
| 36 | EE | Srecko Brlek,
Christophe Reutenauer:
Preface.
Theor. Comput. Sci. 380(3): 219 (2007) |
| 35 | EE | Sylvain Lavallée,
Christophe Reutenauer:
On a zeta function associated with automata and codes.
Theor. Comput. Sci. 381(1-3): 266-273 (2007) |
| 2005 |
|---|
| 34 | EE | Jean-Pierre Borel,
Christophe Reutenauer:
Some New Results on Palindromic Factors of Billiard Words.
Developments in Language Theory 2005: 180-188 |
| 33 | EE | Jean-Pierre Borel,
Christophe Reutenauer:
Palindromic factors of billiard words.
Theor. Comput. Sci. 340(1): 334-348 (2005) |
| 2004 |
|---|
| 32 | EE | Srecko Brlek,
Sylvie Hamel,
Maurice Nivat,
Christophe Reutenauer:
On The Palindromic Complexity Of Infinite Words.
Int. J. Found. Comput. Sci. 15(2): 293-306 (2004) |
| 2003 |
|---|
| 31 | | Srecko Brlek,
Christophe Reutenauer:
On a valuation of rational subsets of Zk Dédié à Jean Berstel
Theor. Comput. Sci. 292(1): 85-96 (2003) |
| 30 | EE | Christophe Hohlweg,
Christophe Reutenauer:
Lyndon words, permutations and trees.
Theor. Comput. Sci. 307(1): 173-178 (2003) |
| 2001 |
|---|
| 29 | EE | Christophe Hohlweg,
Christophe Reutenauer:
Inverses of Words and the Parabolic Structure of the Symmetric Group.
Eur. J. Comb. 22(8): 1075-1082 (2001) |
| 1999 |
|---|
| 28 | EE | Véronique Bruyère,
Christophe Reutenauer:
A Proof of Choffrut's Theorem on Subsequential Functions.
Theor. Comput. Sci. 215(1-2): 329-335 (1999) |
| 1998 |
|---|
| 27 | EE | Claudia Malvenuto,
Christophe Reutenauer:
Plethysm and conjugation of quasi-symmetric functions.
Discrete Mathematics 193(1-3): 225-233 (1998) |
| 1996 |
|---|
| 26 | | Marie-Pierre Béal,
Olivier Carton,
Christophe Reutenauer:
Cyclic Languages and Strongly Cyclic Languages.
STACS 1996: 49-59 |
| 1995 |
|---|
| 25 | EE | Pierre Leroux,
Christophe Reutenauer:
Foreword/Avant-propos.
Discrete Mathematics 139(1-3): 1 (1995) |
| 24 | EE | Christophe Reutenauer,
Marcel Paul Schützenberger:
Variétés et fonctions rationnelles.
Theor. Comput. Sci. 145(1&2): 229-240 (1995) |
| 1994 |
|---|
| 23 | EE | Claudia Malvenuto,
Christophe Reutenauer:
Evacuation of labelled graphs.
Discrete Mathematics 132(1-3): 137-143 (1994) |
| 1993 |
|---|
| 22 | | Ira M. Gessel,
Christophe Reutenauer:
Counting Permutations with Given Cycle Structure and Descent Set.
J. Comb. Theory, Ser. A 64(2): 189-215 (1993) |
| 1992 |
|---|
| 21 | | Anders Björner,
Christophe Reutenauer:
Rationality of the Möbius Function of Subword Order.
Theor. Comput. Sci. 98(1): 53-63 (1992) |
| 1991 |
|---|
| 20 | | Christophe Reutenauer,
Marcel Paul Schützenberger:
Minimization of Rational Word Functions.
SIAM J. Comput. 20(4): 669-685 (1991) |
| 1990 |
|---|
| 19 | | Christophe Reutenauer:
Subsequential Functions: Characterizations, Minimization, Examples.
IMYCS 1990: 62-79 |
| 1988 |
|---|
| 18 | | Jean Berstel,
Christophe Reutenauer:
Zeta Functions of Recognizable Languages.
ICALP 1988: 93-104 |
| 1985 |
|---|
| 17 | | Christophe Reutenauer:
Recent results on codes.
FCT 1985: 351-360 |
| 16 | | Christophe Reutenauer:
Sur Les Semi-Groupes Vérifiant Le Théorème de Kleene.
ITA 19(3): 281-291 (1985) |
| 15 | | Christophe Reutenauer:
The Shuffle Algebra on the Factors of a Word Is Free.
J. Comb. Theory, Ser. A 38(1): 48-57 (1985) |
| 1984 |
|---|
| 14 | | Antonio Restivo,
Christophe Reutenauer:
Cancellation, Pumping and Permutation in Formal Languages.
ICALP 1984: 414-422 |
| 13 | | Antonio Restivo,
Christophe Reutenauer:
On Cancellation Properties of Languages which are Supports of Ration Power Series.
J. Comput. Syst. Sci. 29(2): 153-159 (1984) |
| 12 | | Gérard Jacob,
Christophe Reutenauer:
On Formal Power Series Defined by Infinite Linear Systems.
Theor. Comput. Sci. 32: 339-340 (1984) |
| 1983 |
|---|
| 11 | | Antonio Restivo,
Christophe Reutenauer:
Some Applications of a Theorem of Shirshov to Language Theory
Information and Control 57(2/3): 205-213 (1983) |
| 1982 |
|---|
| 10 | | Christophe Reutenauer:
Biprefix Codes and Semisimple Algebras.
ICALP 1982: 451-457 |
| 9 | | Jean Berstel,
Christophe Reutenauer:
Recognizable Formal Power Series on Trees.
Theor. Comput. Sci. 18: 115-148 (1982) |
| 1981 |
|---|
| 8 | | Christophe Reutenauer:
A New Characterization of the Regular Languages.
ICALP 1981: 177-183 |
| 1980 |
|---|
| 7 | | Jean Berstel,
Christophe Reutenauer:
Séries formelles reconnaissables d'arbres et applications.
CLAAP 1980: 11-21 |
| 6 | | Christophe Reutenauer:
An Ogden-Like Iteration Lemma for Rational Power Series.
Acta Inf. 13: 189-197 (1980) |
| 1979 |
|---|
| 5 | | Christophe Reutenauer:
On Polya series in noncommuting variables.
FCT 1979: 391-396 |
| 4 | | Christophe Reutenauer:
Sur les variétés de langages et de monoídes.
Theoretical Computer Science 1979: 260-265 |
| 3 | | Christophe Reutenauer:
Sur les Series Associees a Certains Systemes de Lindenmayer.
Theor. Comput. Sci. 9: 363-375 (1979) |
| 1978 |
|---|
| 2 | | Christophe Reutenauer:
Sur les Series Rationnelles en Variables Non Commutatives.
ICALP 1978: 372-381 |
| 1977 |
|---|
| 1 | | Christophe Reutenauer:
On a Question of S. Eilenberg.
Theor. Comput. Sci. 5(2): 219 (1977) |
