Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 1677 results
Sort by: relevance publication year

A connection between palindromic and factor complexity using return words

JOURNAL ARTICLE published January 2009 in Advances in Applied Mathematics

Authors: Michelangelo Bucci | Alessandro De Luca | Amy Glen | Luca Q. Zamboni

A new characteristic property of rich words

JOURNAL ARTICLE published August 2009 in Theoretical Computer Science

Authors: Michelangelo Bucci | Alessandro De Luca | Amy Glen | Luca Q. Zamboni

On θ-episturmian words

JOURNAL ARTICLE published February 2009 in European Journal of Combinatorics

Authors: Michelangelo Bucci | Aldo de Luca | Alessandro De Luca | Luca Q. Zamboni

On different generalizations of episturmian words

JOURNAL ARTICLE published March 2008 in Theoretical Computer Science

Authors: Michelangelo Bucci | Aldo de Luca | Alessandro De Luca | Luca Q. Zamboni

On some problems related to palindrome closure

JOURNAL ARTICLE published October 2008 in RAIRO - Theoretical Informatics and Applications

Authors: Michelangelo Bucci | Aldo de Luca | Alessandro De Luca | Luca Q. Zamboni

Rich, Sturmian, and trapezoidal words

JOURNAL ARTICLE published November 2008 in Theoretical Computer Science

Authors: Aldo de Luca | Amy Glen | Luca Q. Zamboni

Some Characterizations of Sturmian Words in Terms of the Lexicographic Order

JOURNAL ARTICLE published 2012 in Fundamenta Informaticae

Authors: Michelangelo Bucci | Alessandro De Luca | Luca Q. Zamboni

Palindromic richness

JOURNAL ARTICLE published February 2009 in European Journal of Combinatorics

Authors: Amy Glen | Jacques Justin | Steve Widmer | Luca Q. Zamboni

Characteristic morphisms of generalized episturmian words

JOURNAL ARTICLE published August 2009 in Theoretical Computer Science

Authors: Michelangelo Bucci | Aldo de Luca | Alessandro De Luca

Rich and Periodic-Like Words

BOOK CHAPTER published 2009 in Developments in Language Theory

Authors: Michelangelo Bucci | Aldo de Luca | Alessandro De Luca

Upper bound for palindromic and factor complexity of rich words

JOURNAL ARTICLE published 2021 in RAIRO - Theoretical Informatics and Applications

Authors: Josef Rukavicka

Reversible Christoffel factorizations

JOURNAL ARTICLE published July 2013 in Theoretical Computer Science

Authors: Michelangelo Bucci | Alessandro De Luca | Luca Q. Zamboni

Corrigendum to “Two-dimensional Fibonacci words: Tandem repeats and factor complexity” [Adv. Appl. Math. 149 (2023) 102553]

JOURNAL ARTICLE published January 2024 in Advances in Applied Mathematics

Authors: M. Sivasankar | R. Rama

Palindromic complexity of infinite words associated with non-simple Parry numbers

JOURNAL ARTICLE published January 2009 in RAIRO - Theoretical Informatics and Applications

Authors: L'ubomíra Balková | Zuzana Masáková

Cost and dimension of words of zero topological entropy

JOURNAL ARTICLE published 2019 in Bulletin de la Société mathématique de France

Factor versus palindromic complexity of uniformly recurrent infinite words

JOURNAL ARTICLE published June 2007 in Theoretical Computer Science

Research funded by Ministerstvo Školství, Mládeže a Tělovýchovy (LC00602) | Grantová Agentura České Republiky (GACˇ R 201/05/0169)

Authors: Peter Baláži | Zuzana Masáková | Edita Pelantová

On a Family of Morphic Images of Arnoux-Rauzy Words

BOOK CHAPTER published 2009 in Language and Automata Theory and Applications

Authors: Michelangelo Bucci | Alessandro De Luca

On prefixal factorizations of words

JOURNAL ARTICLE published February 2016 in European Journal of Combinatorics

Authors: Aldo de Luca | Luca Q. Zamboni

On graphs of central episturmian words

JOURNAL ARTICLE published January 2010 in Theoretical Computer Science

Authors: Aldo de Luca | Luca Q. Zamboni

Involutions of epicentral words

JOURNAL ARTICLE published April 2010 in European Journal of Combinatorics

Research funded by Ministero dell’Istruzione, dell’Università e della Ricerca (090038011)

Authors: Aldo de Luca | Luca Q. Zamboni