Toeplitz words, generalized periodicity and periodically iterated morphisms
From MaRDI portal
Publication:1362993
DOI10.1006/eujc.1996.0110zbMath0881.68065OpenAlexW2053072101MaRDI QIDQ1362993
Julien Cassaigne, Juhani Karhumäki
Publication date: 7 August 1997
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1996.0110
Related Items
Subshifts with slow complexity and simple groups with the Liouville property ⋮ Symmetry groups of infinite words ⋮ On abelian versions of critical factorization theorem ⋮ On Growth and Fluctuation of k-Abelian Complexity ⋮ On growth and fluctuation of \(k\)-abelian complexity ⋮ Words with unbounded periodicity complexity ⋮ Properties of a class of Toeplitz words ⋮ String attractors and infinite words ⋮ Bracket words: A generalisation of Sturmian words arising from generalised polynomials ⋮ A note on the nuclear dimension of Cuntz–Pimsner -algebras associated with minimal shift spaces ⋮ Constructing partial words with subword complexities not achievable by full words ⋮ Infinite self-shuffling words ⋮ Weak abelian periodicity of infinite words ⋮ On automorphism groups of Toeplitz subshifts ⋮ Abelian antipowers in infinite words ⋮ On possible growths of Toeplitz languages ⋮ ALGORITHMIC COMBINATORICS ON PARTIAL WORDS ⋮ On the partitions with Sturmian-like refinements ⋮ Sequences of linear arithmetical complexity ⋮ Language structure of pattern Sturmian words ⋮ On maximal pattern complexity of some automatic words ⋮ Entropie polynomiale des homéomorphismes de Brouwer. Polynomial entropy of Brouwer homeomorphisms ⋮ On the infinite permutation generated by the period doubling word ⋮ Uniform sets and complexity ⋮ On possible growths of arithmetical complexity ⋮ Sequences of low arithmetical complexity ⋮ The weak circular repetition threshold over large alphabets
