| Publication | Date of Publication | Type |
|---|
Greedy palindromic lengths
International Journal of Foundations of Computer Science | 2018-05-17 | Paper |
Aperiodic pseudorandom number generators based on infinite words
Theoretical Computer Science | 2016-09-01 | Paper |
Central sets generated by uniformly recurrent words
Ergodic Theory and Dynamical Systems | 2015-07-13 | Paper |
Reversible Christoffel factorizations
Theoretical Computer Science | 2014-01-10 | Paper |
On additive properties of sets defined by the Thue-Morse word
Journal of Combinatorial Theory. Series A | 2013-12-19 | Paper |
Infinite words with well distributed occurrences
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Enumeration and structure of trapezoidal words
Theoretical Computer Science | 2013-02-19 | Paper |
Some characterizations of Sturmian words in terms of the lexicographic order
Fundamenta Informaticae | 2012-06-20 | Paper |
Some characterizations of Sturmian words in terms of the lexicographic order
Fundamenta Informaticae | 2012-06-20 | Paper |
| Central sets defined by words of low factor complexity | 2011-10-19 | Paper |
On the number of episturmian palindromes
Theoretical Computer Science | 2010-10-11 | Paper |
A new characteristic property of rich words
Theoretical Computer Science | 2009-08-07 | Paper |
A new characteristic property of rich words
Theoretical Computer Science | 2009-08-07 | Paper |
Characteristic morphisms of generalized episturmian words
Theoretical Computer Science | 2009-08-07 | Paper |
Rich and Periodic-Like Words
Developments in Language Theory | 2009-07-07 | Paper |
On a Family of Morphic Images of Arnoux-Rauzy Words
Language and Automata Theory and Applications | 2009-04-02 | Paper |
On \(\theta\)-episturmian words
European Journal of Combinatorics | 2009-03-04 | Paper |
A connection between palindromic and factor complexity using return words
Advances in Applied Mathematics | 2009-01-20 | Paper |
A connection between palindromic and factor complexity using return words
Advances in Applied Mathematics | 2009-01-20 | Paper |
On some problems related to palindrome closure
RAIRO - Theoretical Informatics and Applications | 2008-11-07 | Paper |
On some problems related to palindrome closure
RAIRO - Theoretical Informatics and Applications | 2008-11-07 | Paper |
On a Generalization of Standard Episturmian Morphisms
Developments in Language Theory | 2008-10-30 | Paper |
On different generalizations of episturmian words
Theoretical Computer Science | 2008-04-15 | Paper |
| scientific article; zbMATH DE number 2217214 (Why is no real title available?) | 2006-04-26 | Paper |
