Palindromes in Sturmian Words. - Aldo de Luca; Alessandro De Luca 002 (Developments in Language Theory, 2005)

Combinatorial Properties of Sturmian Palindromes. - Aldo de Luca; Alessandro De Luca 002 (Int. J. Found. Comput. Sci., 2006)

Pseudopalindrome closure operators in free monoids. - Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2006)

Some characterizations of finite Sturmian words. - Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2006)

On a Generalization of Standard Episturmian Morphisms. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002 (Developments in Language Theory, 2008)

On some problems related to palindrome closure. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002; Luca Q. Zamboni (RAIRO Theor. Informatics Appl., 2008)

On different generalizations of episturmian words. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002; Luca Q. Zamboni (Theor. Comput. Sci., 2008)

Rich and Periodic-Like Words. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002 (Developments in Language Theory, 2009)

On a Family of Morphic Images of Arnoux-Rauzy Words. - Michelangelo Bucci; Alessandro De Luca 002 (LATA, 2009)

A connection between palindromic and factor complexity using return words. - Michelangelo Bucci; Alessandro De Luca 002; Amy Glen; Luca Q. Zamboni (Adv. Appl. Math., 2009)

On theta-episturmian words. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002; Luca Q. Zamboni (Eur. J. Comb., 2009)

A new characteristic property of rich words. - Michelangelo Bucci; Alessandro De Luca 002; Amy Glen; Luca Q. Zamboni (Theor. Comput. Sci., 2009)

Characteristic morphisms of generalized episturmian words. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2009)

On the number of episturmian palindromes. - Michelangelo Bucci; Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2010)

Christoffel Words and the Calkin-Wilf Tree. - Alessandro De Luca 002; Christophe Reutenauer (Electron. J. Comb., 2011)

Some Characterizations of Sturmian Words in Terms of the Lexicographic Order. - Michelangelo Bucci; Alessandro De Luca 002; Luca Q. Zamboni (Fundam. Informaticae, 2012)

A generalized palindromization map in free monoids. - Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2012)

Open and Closed Prefixes of Sturmian Words. - Alessandro De Luca 002; Gabriele Fici (WORDS, 2013)

Infinite Words with Well Distributed Occurrences. - L'ubomíra Balková; Michelangelo Bucci; Alessandro De Luca 002; Svetlana Puzynina (WORDS, 2013)

Enumeration and structure of trapezoidal words. - Michelangelo Bucci; Alessandro De Luca 002; Gabriele Fici (Theor. Comput. Sci., 2013)

Reversible Christoffel factorizations. - Michelangelo Bucci; Alessandro De Luca 002; Luca Q. Zamboni (Theor. Comput. Sci., 2013)

Sturmian words and the Stern sequence. - Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2015)

Aperiodic pseudorandom number generators based on infinite words. - L'ubomíra Balková; Michelangelo Bucci; Alessandro De Luca 002; Jirí Hladký; Svetlana Puzynina (Theor. Comput. Sci., 2016)

The sequence of open and closed prefixes of a Sturmian word. - Alessandro De Luca 002; Gabriele Fici; Luca Q. Zamboni (Adv. Appl. Math., 2017)

On Christoffel and standard words and their derivatives. - Alma D'Aniello; Aldo de Luca; Alessandro De Luca 002 (Theor. Comput. Sci., 2017)

Textual Processing in Social Network Analysis. - Flora Amato; Walter Balzano; Giovanni Cozzolino; Alessandro De Luca 002; Francesco Moscato 001 (AINA Workshops, 2019)

Characteristic Parameters and Special Trapezoidal Words. - Alma D'Aniello; Alessandro De Luca 002 (WORDS, 2019)

Extremal values of semi-regular continuants and codings of interval exchange transformations. - Alessandro De Luca 002; Marcia Edson; Luca Q. Zamboni (CoRR, 2021)

On the extremal values of the cyclic continuants of Motzkin and Straus. - Alessandro De Luca 002; Luca Q. Zamboni (CoRR, 2021)

Maximal Closed Substrings. - Golnaz Badkobeh; Alessandro De Luca 002; Gabriele Fici; Simon J. Puglisi (SPIRE, 2022)

On the Lie complexity of Sturmian words. - Alessandro De Luca 002; Gabriele Fici (Theor. Comput. Sci., 2022)

Some results on digital segments and balanced words. - Alessandro De Luca 002; Gabriele Fici (Theor. Comput. Sci., 2024)

Digital Convexity and Combinatorics on Words. - Alessandro De Luca 002; Gabriele Fici; Andrea Frosini (WORDS, 2025)