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
[2]
Hilfe
Suche: Author="Richomme, G."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the fixed points of the iterated pseudopalindromic closure operator
D. Jamet
,
G. Paquin
,
G. Richomme
,
L. Vuillon
Theoretical Computer Science
412
(27), 2011, pp. 2974-2987
Optimality of some algorithms to detect quasiperiodicities
R. Groult
,
G. Richomme
Theoretical Computer Science
411
(34-36), 2010, pp. 3110-3122
Quasiperiodic Sturmian words and morphisms
F. Levé
,
G. Richomme
Theoretical Computer Science
372
(1), 2007, pp. 15-25
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
G. Richomme
Theoretical Computer Science
380
(3), 2007, pp. 393-400
On a conjecture about finite fixed points of morphisms
F. Levé
,
G. Richomme
Theoretical Computer Science
339
(1), 2005, pp. 103-128
Some characterizations of Parikh matrix equivalent binary words
S. Fossé
,
G. Richomme
misc
92
(2), 2004, pp. 77-82
Quasiperiodic infinite words: Some answers
F. Levé
,
G. Richomme
Bull. EATCS
84
, 2004, October, pp. 128-138
Some non finitely generated monoids of repetition-free endomorphisms
G. Richomme
Information Processing Letters
85
(2), 2003, pp. 61-66
Conjugacy and Episturmian morphisms
G. Richomme
Theoretical Computer Science
302
(1-3), 2003, pp. 1-34
Some results on
k
-power-free morphisms
G. Richomme
,
F. Wlazinski
Theoretical Computer Science
273
(1-2), 2002, pp. 119-142
Decidability equivalence between the star problem and the finite power problem in trace monoids
D. Kirsten
,
G. Richomme
Theory of Computing Systems
34
(3), 2001, pp. 193-227
Characterization of test-sets for overlap-free morphisms
G. Richomme
,
P. Séébold
Discrete Applied Mathematics
98
(1-2), 1999, pp. 151-157
Some trace monoids where both the star problem and the finite power property problem are decidable
G. Richomme
Lecture Notes in Computer Science
841
, 1994, pp. 577-586