Toeplitz words, generalized periodicity and periodically iterated morphisms
From MaRDI portal
Publication:1362993
DOI10.1006/eujc.1996.0110zbMath0881.68065MaRDI 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
68Q45: Formal languages and automata
Related Items
On automorphism groups of Toeplitz subshifts, ALGORITHMIC COMBINATORICS ON PARTIAL WORDS, The weak circular repetition threshold over large alphabets, String attractors and infinite words, Bracket words: A generalisation of Sturmian words arising from generalised polynomials, Constructing partial words with subword complexities not achievable by full words, Infinite self-shuffling words, Weak abelian periodicity of infinite words, On possible growths of Toeplitz languages, Sequences of linear arithmetical complexity, Symmetry groups of infinite words, On the infinite permutation generated by the period doubling word, Uniform sets and complexity, Abelian antipowers in infinite words, On the partitions with Sturmian-like refinements, Entropie polynomiale des homéomorphismes de Brouwer. Polynomial entropy of Brouwer homeomorphisms, Subshifts with slow complexity and simple groups with the Liouville property, On growth and fluctuation of \(k\)-abelian complexity, Language structure of pattern Sturmian words, Properties of a class of Toeplitz words, On abelian versions of critical factorization theorem, Words with unbounded periodicity complexity, On maximal pattern complexity of some automatic words, On Growth and Fluctuation of k-Abelian Complexity, On possible growths of arithmetical complexity, Sequences of low arithmetical complexity
