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="de Luca, Aldo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sturmian words and the Stern sequence
Aldo de Luca
,
Alessandro De Luca
Theoretical Computer Science
581
, 2015, pp. 26-44
A coloring problem for infinite words
Aldo de Luca
,
Elena V. Pribavkina
,
Luca Q. Zamboni
Journal of Combinatorial Theory Series A
125
, 2014, pp. 306-332
A generalized palindromization map in free monoids
Aldo de Luca
,
Alessandro De Luca
Theoretical Computer Science
454
, 2012, pp. 109-128
On the number of Episturmian palindromes
Michelangelo Bucci
,
Aldo de Luca
,
Alessandro De Luca
Theoretical Computer Science
411
(40-42), 2010, pp. 3668-3684
On graphs of central Episturmian words
Aldo de Luca
,
Luca Q. Zamboni
Theoretical Computer Science
411
(1), 2010, pp. 70-90
Characteristic morphisms of generalized Episturmian words
Michelangelo Bucci
,
Aldo de Luca
,
Alessandro De Luca
Theoretical Computer Science
410
(30-32), 2009, pp. 2840-2859
On different generalizations of Episturmian words
Michelangelo Bucci
,
Aldo de Luca
,
Alessandro De Luca
,
Luca Q. Zamboni
Theoretical Computer Science
393
(1-3), 2008, pp. 23-36
Rich, Sturmian, and trapezoidal words
Aldo de Luca
,
Amy Glen
,
Luca Q. Zamboni
Theoretical Computer Science
407
(1-3), 2008, pp. 569-573
Some characterizations of finite Sturmian words
Aldo de Luca
,
Alessandro De Luca
Theoretical Computer Science
356
(1-2), 2006, pp. 118-125
Pseudopalindrome closure operators in free monoids
Aldo de Luca
,
Alessandro De Luca
Theoretical Computer Science
362
(1-3), 2006, pp. 282-300
Combinatorial properties of Sturmian palindromes
Aldo de Luca
,
Alessandro de Luca
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 557-573
Completions in measure of languages and related combinatorial problems
Arturo Carpi
,
Aldo de Luca
Theoretical Computer Science
330
(1), 2005, pp. 35-57
Codes of central Sturmian words
Arturo Carpi
,
Aldo de Luca
Theoretical Computer Science
340
(2), 2005, pp. 220-239
Repetitions, fullness, and uniformity in two-dimensional words
Arturo Carpi
,
Aldo de Luca
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 355-383
Some combinatorial results on Bernoulli sets and codes
Aldo de Luca
Theoretical Computer Science
273
(1-2), 2002, pp. 143-165
Periodic-like words
Arturo Carpi
,
Aldo de Luca
Lecture Notes in Computer Science
1893
, 2000, pp. 264-274
On the combinatorics of finite words
Aldo de Luca
Theoretical Computer Science
218
(1), 1999, pp. 13-39
A conjecture on continued fractions
Aldo de Luca
Theoretical Computer Science
204
(1-2), 1998, pp. 75-86
Standard Sturmian morphisms
Aldo de Luca
Theoretical Computer Science
178
(1-2), 1997, pp. 205-224
Sturmian words: Structure, combinatorics, and their artihmetics
Aldo de Luca
Theoretical Computer Science
183
(1), 1997, pp. 45-82
On standard Sturmian morphisms
Aldo de Luca
Lecture Notes in Computer Science
1099
, 1996, pp. 403-415
A division property of the Fibonacci word
Aldo de Luca
Information Processing Letters
54
, 1995, pp. 307-312
Some combinatorial properties of Sturmian words
Aldo de Luca
,
Filippo Mignosi
Theoretical Computer Science
136
(2), 1994, pp. 361-385
On bispecial factors of the Thue-Morse word
Aldo de Luca
,
Licia Mione
Information Processing Letters
49
, 1994, pp. 179-183
Well quasi-orders and regular languages
Aldo de Luca
,
Stefano Varricchio
Acta Informatica
31
, 1994, pp. 539-557
Seiten 1
2
>