Back to Search
Start Over
Properties of a Class of Toeplitz Words
- Publication Year :
- 2021
-
Abstract
- We study the properties of the uncountable set of Stewart words. These are Toeplitz words specified by infinite sequences of Toeplitz patterns of the form $\alpha\beta\gamma$, where $\alpha,\beta,\gamma$ is any permutation of the symbols 0,1,?. We determine the critical exponent of the Stewart words, prove that they avoid the pattern $xxyyxx$, find all factors that are palindromes, and determine their subword complexity. An interesting aspect of our work is that we use automata-theoretic methods and a decision procedure for automata to carry out the proofs.
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2112.12125
- Document Type :
- Working Paper