Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Reutenauer, Christoph"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generation of combinatorial structures
Srec̑ko Brlek
,
Christophe Reutenauer
,
Jean-Guy Penaud
Theoretical Computer Science
502
, 2013, pp. 1-3
A self paired Hopf algebra on double posets and a Littlewood-Richardson rule
Claudia Malvenuto
,
Christophe Reutenauer
Journal of Combinatorial Theory Series A
118
(4), 2011, pp. 1322-1333
On the superimposition of Christoffel words
Genevi`eve Paquin
,
Christophe Reutenauer
Theoretical Computer Science
412
(4-5), 2011, pp. 402-418
A Sturmian sequence related to the uniqueness conjecture for Markoff numbers
Yann Bugeaud
,
Christophe Reutenauer
,
Samir Siksek
Theoretical Computer Science
410
(30-32), 2009, pp. 2864-2869
Another proof of Soittola's theorem
Jean Berstel
,
Christophe Reutenauer
Theoretical Computer Science
393
(1-3), 2008, pp. 196-203
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids
Jean Berstel
,
Christophe Reutenauer
Theoretical Computer Science
400
(1-3), 2008, pp. 144-158
A palindromization map for the free group
Christian Kassel
,
Christophe Reutenauer
Theoretical Computer Science
409
(3), 2008, pp. 461-470
On a zeta function associated with automata and codes
Sylvain Lavallée
,
Christophe Reutenauer
Theoretical Computer Science
381
(1-3), 2007, pp. 266-273
On a valuation of rational subsets of
Z^k
- Dédié à Jean Berstel
Srec̑ko Brlek
,
Christoph Reutenauer
Theoretical Computer Science
292
(1), 2003, pp. 85-96
Lyndon words, permutations and trees
Christophe Hohlweg
,
Christophe Reutenauer
Theoretical Computer Science
307
(1), 2003, pp. 173-178
A proof of Choffrut's theorem on subsequential functions
Véronique Bruyère
,
Christoph Reutenauer
Theoretical Computer Science
215
(1-2), 1999, pp. 329-335
Cyclic languages and strongly cyclic languages
Marie-Pierre Béal
,
Olivier Carton
,
Christophe Reutenauer
Lecture Notes in Computer Science
1046
, 1996, pp. 49-59
Variétés et fonctions rationnelles
Christophe Reutenauer
,
Marcel Paul Schützenberger
Theoretical Computer Science
145
(1-2), 1995, pp. 229-240
Counting permutations with given cycle structure and descent set
Ira M. Gessel
,
Christophe Reutenauer
Journal of Combinatorial Theory Series A
64
(2), 1993, pp. 189-215
Computing Hall exponents in the free group
Guy Malançon
,
Christophe Reutenauer
International Journal of Algebra and Computation
3
(3), 1993, pp. 275-294
Rationality of the Möbius function of subword order
Anders Björner
,
Christophe Reutenauer
Theoretical Computer Science
98
, 1992, pp. 53-63
Minimization of rational word functions
Christophe Reutenauer
,
Marcel-Paul Schützenberger
SIAM Journal on Computing
20
(4), 1991, August, pp. 669-685
The shuffle algebra on the factors of a word is free
Christophe Reutenauer
Journal of Combinatorial Theory Series A
38
, 1985, pp. 48-57
Some Applications of a Theorem of Shirshov to Language Theory
Antonio Restivo
,
Christophe Reutenauer
Information and Control
57
(2/3), 1983, pp. 205-213
A new characterization of the regular languages
Christoph Reutenauer
Lecture Notes in Computer Science
115
, 1981, pp. 177-183
An Ogden-like iteration lemma for rational power series
Christophe Reutenauer
Acta Informatica
13
, 1980, pp. 189-197