On prefixal factorizations of words (original) (raw)
Related papers
A Coloring Problem for Sturmian and Episturmian Words
Lecture Notes in Computer Science, 2013
A coloring problem for infinite words
Journal of Combinatorial Theory, Series A, 2014
Special factors, periodicity, and an application to Sturmian words
Acta Informatica, 2000
A defect theorem for bi-infinite words
Theoretical Computer Science, 2003
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science, 2008
Some characterizations of finite Sturmian words
Theoretical Computer Science, 2006
Finite and infinite closed-rich words
arXiv (Cornell University), 2021
Sturmian words: structure, combinatorics, and their arithmetics
Theoretical Computer Science, 1997
Periodic-like words, periodicity, and boxes
Acta Informatica, 2001
On the superimposition of Christoffel words
Theoretical Computer Science, 2011
The Overlap Gap Between Left-Infinite and Right-Infinite Words
International Journal of Foundations of Computer Science, 2021
Defect Effect of Bi-infinite Words in the Two-element Case
Discrete Mathematics & Theoretical Computer Science, 2001
On a conjecture on bidimensional words
Theoretical Computer Science, 2003
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
Theoretical Computer Science, 1999
Periodicity properties on partial words
Information and Computation, 2008
Some combinatorial properties of Sturmian words
Theoretical Computer Science, 1994
Remarks on Two Nonstandard Versions of Periodicity in Words
International Journal of Foundations of Computer Science, 2008
Computers & Mathematics with Applications, 2004
Periodic and Sturmian languages
Information Processing Letters, 2006
Partitioned factors in Christoffel and Sturmian words
Theoretical Computer Science
Lyndon factorization of sturmian words
Discrete Mathematics, 2000
On a special class of primitive words
Theoretical Computer Science, 2010
Open and Closed Prefixes of Sturmian Words
Lecture Notes in Computer Science, 2013
A generalization of Sturmian sequences: combinatorial structure and transcendence
Acta Arith, 2000
Partial words and a theorem of Fine and Wilf revisited
Theoretical Computer Science, 2002
Journal of Combinatorial Theory, Series A, 2018
Sturmian words with balanced construction
Semiperiodic words and root-conjugacy
Theoretical Computer Science, 2003
Combinatorial properties of smooth infinite words
Theoretical Computer Science, 2006
Infinite words without palindrome
2009
Lecture Notes in Computer Science, 2009
arXiv (Cornell University), 2020
Open and closed factors of Arnoux-Rauzy words
arXiv (Cornell University), 2018
Fine and Wilf 's Periodicity on Partial Words and Consequences
Central sets defined by words of low factor complexity
2011