48 citations · 248 across the 18 of their papers we have counts for
7 papers · 1 filter
On the Lie complexity of Sturmian words
Alessandro De Luca, Gabriele Fici
Bell and Shallit recently introduced the Lie complexity of an infinite word as the function counting for each length the number of conjugacy classes of words whose elements are…
Characteristic Parameters and Special Trapezoidal Words
Alma D'Aniello, Alessandro De Luca
Following earlier work by Aldo de Luca and others, we study trapezoidal words and their prefixes, with respect to their characteristic parameters and (length of shortest un…
The sequence of open and closed prefixes of a Sturmian word
Alessandro De Luca, Gabriele Fici, Luca Q. Zamboni
A finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We are interested in the…
On Christoffel and standard words and their derivatives
Alma D'Aniello, Aldo de Luca, Alessandro De Luca
We introduce and study natural derivatives for Christoffel and finite standard words, as well as for characteristic Sturmian words. These derivatives, which are realized as inverse…
Sturmian words and the Stern sequence
Aldo de Luca, Alessandro De Luca
Central, standard, and Christoffel words are three strongly interrelated classes of binary finite words which represent a finite counterpart of characteristic Sturmian words. A nat…
Reversible Christoffel factorizations
Michelangelo Bucci, Alessandro De Luca, Luca Q. Zamboni
We define a family of natural decompositions of Sturmian words in Christoffel words, called *reversible Christoffel* (RC) factorizations. They arise from the observation that two S…
A generalized palindromization map in free monoids
Aldo de Luca, Alessandro De Luca
The palindromization map in a free monoid was introduced in 1997 by the first author in the case of a binary alphabet , and later extended by other authors to arbitrar…