Descendants of Primitive Substitutions. - Charles Holton; Luca Q. Zamboni (Theory Comput. Syst., 1999)

Combinatorics of Three-Interval Exchanges. - Sébastien Ferenczi; Charles Holton; Luca Q. Zamboni (ICALP, 2001)

A Note on a Conjecture of Duval and Sturmian Words. - Filippo Mignosi; Luca Q. Zamboni (RAIRO Theor. Informatics Appl., 2002)

On representations of positive integers in the Fibonacci base. - Marcia Edson; Luca Q. Zamboni (Theor. Comput. Sci., 2004)

Characterisations of balanced words via orderings. - Oliver Jenkinson; Luca Q. Zamboni (Theor. Comput. Sci., 2004)

Periodicity and local complexity. - Anthony Quas; Luca Q. Zamboni (Theor. Comput. Sci., 2004)

Suffix Automata and Standard Sturmian Words. - Marinella Sciortino; Luca Q. Zamboni (Developments in Language Theory, 2007)

Relationally Periodic Sequences and Subword Complexity. - Julien Cassaigne; Tomi Kärki; Luca Q. Zamboni (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, Sturmian, and trapezoidal words. - Aldo de Luca; Amy Glen; Luca Q. Zamboni (Theor. Comput. Sci., 2008)

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)

Palindromic richness. - Amy Glen; Jacques Justin; Steve Widmer; 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)

Fine and Wilf words for any periods II. - Robert Tijdeman; Luca Q. Zamboni (Theor. Comput. Sci., 2009)

Balance and Abelian complexity of the Tribonacci word. - Gwénaël Richomme; Kalle Saari; Luca Q. Zamboni (Adv. Appl. Math., 2010)

Involutions of epicentral words. - Aldo de Luca; Luca Q. Zamboni (Eur. J. Comb., 2010)

Standard factors of Sturmian words. - Gwénaël Richomme; Kalle Saari; Luca Q. Zamboni (RAIRO Theor. Informatics Appl., 2010)

On graphs of central episturmian words. - Aldo de Luca; Luca Q. Zamboni (Theor. Comput. Sci., 2010)

Combinatorial trees arising in the study of interval exchange transformations. - Julien Cassaigne; Sébastien Ferenczi; Luca Q. Zamboni (Eur. J. Comb., 2011)

Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. - Julien Cassaigne; Gwénaël Richomme; Kalle Saari; Luca Q. Zamboni (Int. J. Found. Comput. Sci., 2011)

Abelian complexity of minimal subshifts. - Gwénaël Richomme; Kalle Saari; Luca Q. Zamboni (J. Lond. Math. Soc., 2011)

On minimal factorizations of words as products of palindromes - Anna E. Frid; Svetlana Puzynina; Luca Q. Zamboni (CoRR, 2012)

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

On automatic infinite permutations. - Anna E. Frid; Luca Q. Zamboni (RAIRO Theor. Informatics Appl., 2012)

A Coloring Problem for Sturmian and Episturmian Words. - Aldo de Luca; Elena V. Pribavkina; Luca Q. Zamboni (Developments in Language Theory, 2013)

Self-shuffling Words. - Emilie Charlier; Teturo Kamae; Svetlana Puzynina; Luca Q. Zamboni (ICALP (2), 2013)

On palindromic factorization of words. - Anna E. Frid; Svetlana Puzynina; Luca Q. Zamboni (Adv. Appl. Math., 2013)

On additive properties of sets defined by the Thue-Morse word. - Michelangelo Bucci; Neil Hindman; Svetlana Puzynina; Luca Q. Zamboni (J. Comb. Theory A, 2013)

On a generalization of Abelian equivalence and complexity of infinite words. - Juhani Karhumäki; Aleksi Saarela; Luca Q. Zamboni (J. Comb. Theory A, 2013)

Abelian returns in Sturmian words. - Svetlana Puzynina; Luca Q. Zamboni (J. Comb. Theory A, 2013)

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

On the least number of palindromes contained in an infinite word. - Gabriele Fici; Luca Q. Zamboni (Theor. Comput. Sci., 2013)

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. - Juhani Karhumäki; Aleksi Saarela; Luca Q. Zamboni (Developments in Language Theory, 2014)

Subword Complexity and Decomposition of the Set of Factors. - Julien Cassaigne; Anna E. Frid; Svetlana Puzynina; Luca Q. Zamboni (MFCS (1), 2014)

Extremal words in morphic subshifts. - James D. Currie; Narad Rampersad; Kalle Saari; Luca Q. Zamboni (Discret. Math., 2014)

Infinite self-shuffling words. - Emilie Charlier; Teturo Kamae; Svetlana Puzynina; Luca Q. Zamboni (J. Comb. Theory A, 2014)

A coloring problem for infinite words. - Aldo de Luca; Elena V. Pribavkina; Luca Q. Zamboni (J. Comb. Theory A, 2014)

On generating binary words palindromically. - Tero Harju; Mari Huova; Luca Q. Zamboni (J. Comb. Theory A, 2015)

Words 2013. - Juhani Karhumäki; Luca Q. Zamboni (Theor. Comput. Sci., 2015)

Cost and dimension of words of zero topological entropy. - Julien Cassaigne; Anna E. Frid; Svetlana Puzynina; Luca Q. Zamboni (CoRR, 2016)

Abelian bordered factors and periodicity. - Émilie Charlier; Tero Harju; Svetlana Puzynina; Luca Q. Zamboni (Eur. J. Comb., 2016)

On prefixal factorizations of words. - Aldo de Luca; Luca Q. Zamboni (Eur. J. Comb., 2016)

On some variations of coloring problems of infinite words. - Aldo de Luca; Luca Q. Zamboni (J. Comb. Theory A, 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)

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. - Juhani Karhumäki; Aleksi Saarela; Luca Q. Zamboni (Acta Cybern., 2017)

A Taxonomy of Morphic Sequences. - Jean-Paul Allouche; Julien Cassaigne; Jeffrey O. Shallit; Luca Q. Zamboni (CoRR, 2017)

Cyclic complexity of words. - Julien Cassaigne; Gabriele Fici; Marinella Sciortino; Luca Q. Zamboni (J. Comb. Theory A, 2017)

Anti-powers in infinite words. - Gabriele Fici; Antonio Restivo; Manuel Silva 003; Luca Q. Zamboni (J. Comb. Theory A, 2018)

Open and closed factors in Arnoux-Rauzy words. - Olga G. Parshina; Luca Q. Zamboni (Adv. Appl. Math., 2019)

Combining Extensions of the Hales-Jewett Theorem with Ramsey Theory in Other Structures. - Neil Hindman; Dona Strauss; Luca Q. Zamboni (Electron. J. Comb., 2019)

ω-Lyndon words. - Mickaël Postic; Luca Q. Zamboni (Theor. Comput. Sci., 2020)

Reprint of: ω-Lyndon words. - Mickaël Postic; Luca Q. Zamboni (Theor. Comput. Sci., 2020)

Continuants with Equal Values, a Combinatorial Approach. - Gerhard Ramharter; Luca Q. Zamboni (WORDS, 2021)

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)

Order Conditions for Languages. - Sébastien Ferenczi; Pascal Hubert; Luca Q. Zamboni (WORDS, 2023)

Clustering and Arnoux-Rauzy words. - Sébastien Ferenczi; Luca Q. Zamboni (Adv. Appl. Math., 2024)