default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristophe Reutenauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2010
[b3]Jean Berstel, Dominique Perrin, Christophe Reutenauer:
Codes and Automata. Encyclopedia of mathematics and its applications 129, Cambridge University Press 2010, ISBN 978-0-521-88831-8, pp. I-XIII, 1-619- 1988
- [b2]Jean Berstel, Christophe Reutenauer:
Rational series and their languages. EATCS monographs on theoretical computer science 12, Springer 1988, ISBN 0387186263, pp. I-VIII, 1-151 - 1980
- [b1]Christophe Reutenauer:
Series rationnelles et algebres syntactiques. Univ. Paris, 1980, pp. 1-209
Journal Articles
- 2023
- [j64]Dominique Perrin
, Christophe Reutenauer:
The palindromization map. Discret. Appl. Math. 340: 202-214 (2023) - 2021
- [j63]Christophe Reutenauer:
Christoffel words and weak Markoff theory. Adv. Appl. Math. 127: 102179 (2021) - [j62]Antoine Abram, Nathan Chapelier-Laget, Christophe Reutenauer:
An Order on Circular Permutations. Electron. J. Comb. 28(3) (2021) - [j61]Dominique Perrin, Christophe Reutenauer:
Graded alphabets, circular codes, free Lie algebras and comma-free codes. Discret. Math. 344(1): 112167 (2021) - [j60]Claudia Malvenuto, Christophe Reutenauer:
Primitive elements of the Hopf algebras of tableaux. Eur. J. Comb. 98: 103381 (2021) - 2020
- [j59]Antoine Abram, Mélodie Lapointe, Christophe Reutenauer:
Palindromization and construction of Markoff triples. Theor. Comput. Sci. 809: 21-29 (2020) - [j58]Antoine Abram, Mélodie Lapointe, Christophe Reutenauer:
Reprint of: Palindromization and construction of Markoff triples. Theor. Comput. Sci. 834: 75-83 (2020) - 2019
- [j57]Benjamin Blanchette, Christian Choffrut, Christophe Reutenauer:
Quasi-automatic semigroups. Theor. Comput. Sci. 777: 111-120 (2019) - [j56]Francesco Dolce, Antonio Restivo, Christophe Reutenauer:
On generalized Lyndon words. Theor. Comput. Sci. 777: 232-242 (2019) - 2018
- [j55]Dominique Perrin, Christophe Reutenauer:
Hall sets, Lazard sets and comma-free codes. Discret. Math. 341(1): 232-243 (2018) - [j54]Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone:
Birecurrent sets. Int. J. Algebra Comput. 28(4): 613-652 (2018) - [j53]Alexandre Blondin Massé, Srecko Brlek, Christophe Reutenauer:
Preface. Int. J. Found. Comput. Sci. 29(5): 701-704 (2018) - 2017
- [j52]Robert Cori, Christophe Reutenauer:
On Sillke's bijection. Theor. Comput. Sci. 658: 97-104 (2017) - [j51]Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Specular sets. Theor. Comput. Sci. 684: 3-28 (2017) - 2015
- [j50]Sébastien Labbé, Christophe Reutenauer:
A d-dimensional Extension of Christoffel Words. Discret. Comput. Geom. 54(1): 152-181 (2015) - [j49]Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Maximal bifix decoding. Discret. Math. 338(5): 725-742 (2015) - [j48]Christophe Reutenauer:
Studies on finite Sturmian words. Theor. Comput. Sci. 591: 106-133 (2015) - 2013
- [j47]Srecko Brlek, Christophe Reutenauer, Jean-Guy Penaud:
Generation of Combinatorial Structures. Theor. Comput. Sci. 502: 1-3 (2013) - 2012
- [j46]Christophe Reutenauer:
On a Matrix Representation for Polynomially Recursive Sequences. Electron. J. Comb. 19(3): 36 (2012) - [j45]Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33(7): 1386-1401 (2012) - [j44]Ira M. Gessel, Antonio Restivo, Christophe Reutenauer:
A bijection between words and multisets of necklaces. Eur. J. Comb. 33(7): 1537-1546 (2012) - 2011
- [j43]Alessandro De Luca, Christophe Reutenauer:
Christoffel Words and the Calkin-Wilf Tree. Electron. J. Comb. 18(2) (2011) - [j42]Jean-Christophe Novelli, Christophe Reutenauer, Jean-Yves Thibon:
Generalized descent patterns in permutations and associated Hopf algebras. Eur. J. Comb. 32(4): 618-627 (2011) - [j41]Claudia Malvenuto, Christophe Reutenauer:
A self paired Hopf algebra on double posets and a Littlewood-Richardson rule. J. Comb. Theory A 118(4): 1322-1333 (2011) - [j40]Geneviève Paquin, Christophe Reutenauer:
On the superimposition of Christoffel words. Theor. Comput. Sci. 412(4-5): 402-418 (2011) - [j39]Srecko Brlek, Christophe Reutenauer:
Complexity and palindromic defect of infinite words. Theor. Comput. Sci. 412(4-5): 493-497 (2011) - 2009
- [j38]Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer:
Lyndon + Christoffel = digitally convex. Pattern Recognit. 42(10): 2239-2246 (2009) - [j37]Yann Bugeaud, Christophe Reutenauer, Samir Siksek:
A Sturmian sequence related to the uniqueness conjecture for Markoff numbers. Theor. Comput. Sci. 410(30-32): 2864-2869 (2009) - 2008
- [j36]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) - [j35]Christophe Reutenauer:
Michel Fliess and non-commutative formal power series. Int. J. Control 81(3): 338-343 (2008) - [j34]Jean Berstel, Christophe Reutenauer:
Another proof of Soittola's theorem. Theor. Comput. Sci. 393(1-3): 196-203 (2008) - [j33]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) - [j32]Christian Kassel, Christophe Reutenauer:
A palindromization map for the free group. Theor. Comput. Sci. 409(3): 461-470 (2008) - 2007
- [j31]Srecko Brlek, Christophe Reutenauer:
Preface. Theor. Comput. Sci. 380(3): 219 (2007) - [j30]Sylvain Lavallée, Christophe Reutenauer:
On a zeta function associated with automata and codes. Theor. Comput. Sci. 381(1-3): 266-273 (2007) - 2006
- [j29]Jean-Pierre Borel, Christophe Reutenauer:
On Christoffel classes. RAIRO Theor. Informatics Appl. 40(1): 15-27 (2006) - 2005
- [j28]Peter McNamara, Christophe Reutenauer:
P-Partitions and a Multi-Parameter Klyachko Idempotent. Electron. J. Comb. 11(2) (2005) - [j27]Jean-Pierre Borel, Christophe Reutenauer:
Palindromic factors of billiard words. Theor. Comput. Sci. 340(1): 334-348 (2005) - 2004
- [j26]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
- [j25]Srecko Brlek, Christophe Reutenauer:
On a valuation of rational subsets of Zk Dédié à Jean Berstel. Theor. Comput. Sci. 292(1): 85-96 (2003) - [j24]Christophe Hohlweg, Christophe Reutenauer:
Lyndon words, permutations and trees. Theor. Comput. Sci. 307(1): 173-178 (2003) - 2002
- [j23]Frédéric Patras, Christophe Reutenauer:
On Dynkin and Klyachko Idempotents in Graded Bialgebras. Adv. Appl. Math. 28(3-4): 560-579 (2002) - 2001
- [j22]Christophe Hohlweg, Christophe Reutenauer:
Inverses of Words and the Parabolic Structure of the Symmetric Group. Eur. J. Comb. 22(8): 1075-1082 (2001) - 1999
- [j21]P. M. Cohn, Christophe Reutenauer:
On the Construction of the Free Field. Int. J. Algebra Comput. 9(3-4): 307-324 (1999) - [j20]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
- [j19]Claudia Malvenuto, Christophe Reutenauer:
Plethysm and conjugation of quasi-symmetric functions. Discret. Math. 193(1-3): 225-233 (1998) - 1995
- [j18]Pierre Leroux, Christophe Reutenauer:
Foreword/Avant-propos. Discret. Math. 139(1-3): 1 (1995) - [j17]Christophe Reutenauer, Marcel Paul Schützenberger:
Variétés et fonctions rationnelles. Theor. Comput. Sci. 145(1&2): 229-240 (1995) - 1994
- [j16]Claudia Malvenuto, Christophe Reutenauer:
Evacuation of labelled graphs. Discret. Math. 132(1-3): 137-143 (1994) - 1993
- [j15]Guy Melançon, Christophe Reutenauer:
Computing Hall exponents in the Free Group. Int. J. Algebra Comput. 3(3): 275-294 (1993) - [j14]Ira M. Gessel, Christophe Reutenauer:
Counting Permutations with Given Cycle Structure and Descent Set. J. Comb. Theory A 64(2): 189-215 (1993) - 1992
- [j13]Anders Björner, Christophe Reutenauer:
Rationality of the Möbius Function of Subword Order. Theor. Comput. Sci. 98(1): 53-63 (1992) - 1991
- [j12]Christophe Reutenauer, Marcel Paul Schützenberger:
Minimization of Rational Word Functions. SIAM J. Comput. 20(4): 669-685 (1991) - 1990
- [j11]François Bergeron, Christophe Reutenauer:
Combinatorial Resolution of Systems of Differential Equations III: a Special Class of Differentially Algebraic Series. Eur. J. Comb. 11(6): 501-512 (1990) - 1985
- [j10]Christophe Reutenauer:
Sur Les Semi-Groupes Vérifiant Le Théorème de Kleene. RAIRO Theor. Informatics Appl. 19(3): 281-291 (1985) - [j9]Christophe Reutenauer:
The Shuffle Algebra on the Factors of a Word Is Free. J. Comb. Theory A 38(1): 48-57 (1985) - [j8]Antonio Restivo, Christophe Reutenauer:
Rational Languages and the Burnside Problem. Theor. Comput. Sci. 40: 13-30 (1985) - 1984
- [j7]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) - [j6]Gérard Jacob, Christophe Reutenauer:
On Formal Power Series Defined by Infinite Linear Systems. Theor. Comput. Sci. 32: 339-340 (1984) - 1983
- [j5]Antonio Restivo, Christophe Reutenauer:
Some Applications of a Theorem of Shirshov to Language Theory. Inf. Control. 57(2/3): 205-213 (1983) - 1982
- [j4]Jean Berstel, Christophe Reutenauer:
Recognizable Formal Power Series on Trees. Theor. Comput. Sci. 18: 115-148 (1982) - 1980
- [j3]Christophe Reutenauer:
An Ogden-Like Iteration Lemma for Rational Power Series. Acta Informatica 13: 189-197 (1980) - 1979
- [j2]Christophe Reutenauer:
Sur les Series Associees a Certains Systemes de Lindenmayer. Theor. Comput. Sci. 9: 363-375 (1979) - 1977
- [j1]Christophe Reutenauer:
On a Question of S. Eilenberg. Theor. Comput. Sci. 5(2): 219 (1977)
Conference and Workshop Papers
- 2024
- [c17]Yan Lanciault, Christophe Reutenauer:
A Symmetry Property of Christoffel Words. GASCom 2024: 123-127 - 2019
- [c16]Francesco Dolce, Antonio Restivo, Christophe Reutenauer:
Some Variations on Lyndon Words (Invited Talk). CPM 2019: 2:1-2:14 - [c15]Jean-Éric Pin, Christophe Reutenauer:
A Mahler's Theorem for Word Functions. ICALP 2019: 125:1-125:13 - 2015
- [c14]Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Specular Sets. WORDS 2015: 210-222 - 2005
- [c13]Jean-Pierre Borel, Christophe Reutenauer:
Some New Results on Palindromic Factors of Billiard Words. Developments in Language Theory 2005: 180-188 - 1996
- [c12]Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer:
Cyclic Languages and Strongly Cyclic Languages. STACS 1996: 49-59 - 1994
- [c11]Christophe Reutenauer:
A Survey of Noncommutative Rational Series. Formal Power Series and Algebraic Combinatorics 1994: 159-169 - 1990
- [c10]Christophe Reutenauer:
Subsequential Functions: Characterizations, Minimization, Examples. IMYCS 1990: 62-79 - 1988
- [c9]Jean Berstel, Christophe Reutenauer:
Zeta Functions of Recognizable Languages. ICALP 1988: 93-104 - 1985
- [c8]Christophe Reutenauer:
Recent results on codes. FCT 1985: 351-360 - 1984
- [c7]Antonio Restivo, Christophe Reutenauer:
Cancellation, Pumping and Permutation in Formal Languages. ICALP 1984: 414-422 - 1982
- [c6]Christophe Reutenauer:
Biprefix Codes and Semisimple Algebras. ICALP 1982: 451-457 - 1981
- [c5]Christophe Reutenauer:
A New Characterization of the Regular Languages. ICALP 1981: 177-183 - 1980
- [c4]Jean Berstel, Christophe Reutenauer:
Séries formelles reconnaissables d'arbres et applications. CLAAP 1980: 11-21 - 1979
- [c3]Christophe Reutenauer:
On Polya series in noncommuting variables. FCT 1979: 391-396 - [c2]Christophe Reutenauer:
Sur les variétés de langages et de monoídes. Theoretical Computer Science 1979: 260-265 - 1978
- [c1]Christophe Reutenauer:
Sur les Series Rationnelles en Variables Non Commutatives. ICALP 1978: 372-381
Editorship
- 2017
- [e3]Srecko Brlek, Francesco Dolce, Christophe Reutenauer, Élise Vandomme:
Combinatorics on Words - 11th International Conference, WORDS 2017, Montréal, QC, Canada, September 11-15, 2017, Proceedings. Lecture Notes in Computer Science 10432, Springer 2017, ISBN 978-3-319-66395-1 [contents] - 2016
- [e2]Srecko Brlek, Christophe Reutenauer:
Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings. Lecture Notes in Computer Science 9840, Springer 2016, ISBN 978-3-662-53131-0 [contents] - 2009
- [e1]Srecko Brlek, Christophe Reutenauer, Xavier Provençal:
Discrete Geometry for Computer Imagery, 15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009. Proceedings. Lecture Notes in Computer Science 5810, Springer 2009, ISBN 978-3-642-04396-3 [contents]
Informal and Other Publications
- 2024
- [i12]Christophe Reutenauer, Jeffrey O. Shallit:
Christoffel Matrices and Sturmian Determinants. CoRR abs/2409.09824 (2024) - 2019
- [i11]Francesco Dolce, Antonio Restivo, Christophe Reutenauer:
Some variations on Lyndon words. CoRR abs/1904.00954 (2019) - [i10]Benjamin Blanchette, Christian Choffrut, Christophe Reutenauer:
Quasi-automatic semigroups. CoRR abs/1906.02842 (2019) - 2018
- [i9]Francesco Dolce, Antonio Restivo, Christophe Reutenauer:
On generalized Lyndon words. CoRR abs/1812.04515 (2018) - 2017
- [i8]Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone:
Recurrent and birecurrent sets. CoRR abs/1703.10081 (2017) - 2015
- [i7]Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Specular sets. CoRR abs/1505.00707 (2015) - 2014
- [i6]Sébastien Labbé, Christophe Reutenauer:
A d-dimensional extension of Christoffel words. CoRR abs/1404.4021 (2014) - 2013
- [i5]Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Return words in interval exchange transformations. CoRR abs/1305.0120 (2013) - [i4]Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Bifix codes and the finite index basis property. CoRR abs/1305.0127 (2013) - [i3]Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Bifix codes in acyclic sets. CoRR abs/1308.4260 (2013) - 2010
- [i2]Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Bifix codes and Sturmian words. CoRR abs/1011.5369 (2010) - 2008
- [i1]Sylvain Lavallée, Christophe Reutenauer, Vladimir Retakh, Dominique Perrin:
Codes and Noncommutative Stochastic Matrices. CoRR abs/0808.4100 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
