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 |
A new characteristic property of rich words JOURNAL ARTICLE published August 2009 in Theoretical Computer Science |
On JOURNAL ARTICLE published February 2009 in European Journal of Combinatorics |
On different generalizations of episturmian words JOURNAL ARTICLE published March 2008 in Theoretical Computer Science |
On some problems related to palindrome closure JOURNAL ARTICLE published October 2008 in RAIRO - Theoretical Informatics and Applications |
Rich, Sturmian, and trapezoidal words JOURNAL ARTICLE published November 2008 in Theoretical Computer Science |
Some Characterizations of Sturmian Words in Terms of the Lexicographic Order JOURNAL ARTICLE published 2012 in Fundamenta Informaticae |
Palindromic richness JOURNAL ARTICLE published February 2009 in European Journal of Combinatorics |
Characteristic morphisms of generalized episturmian words JOURNAL ARTICLE published August 2009 in Theoretical Computer Science |
Rich and Periodic-Like Words BOOK CHAPTER published 2009 in Developments in Language Theory |
Upper bound for palindromic and factor complexity of rich words JOURNAL ARTICLE published 2021 in RAIRO - Theoretical Informatics and Applications |
Reversible Christoffel factorizations JOURNAL ARTICLE published July 2013 in Theoretical Computer Science |
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 |
Palindromic complexity of infinite words associated with non-simple Parry numbers JOURNAL ARTICLE published January 2009 in RAIRO - Theoretical Informatics and Applications |
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) |
On a Family of Morphic Images of Arnoux-Rauzy Words BOOK CHAPTER published 2009 in Language and Automata Theory and Applications |
On prefixal factorizations of words JOURNAL ARTICLE published February 2016 in European Journal of Combinatorics |
On graphs of central episturmian words JOURNAL ARTICLE published January 2010 in Theoretical Computer Science |
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) |