Toeplitz words, generalized periodicity and periodically iterated morphisms

DOI10.1006/EUJC.1996.0110zbMATH Open0881.68065OpenAlexW2053072101MaRDI QIDQ1362993FDOQ1362993

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

Recommendations

• On the power of periodic iteration of morphisms
• Maximal pattern complexity for Toeplitz words
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• scientific article; zbMATH DE number 3874638

zbMATH Keywords

Toeplitz words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (31)

• On possible growths of Toeplitz languages
• Sequences of linear arithmetical complexity
• Symmetry groups of infinite words
• Quasiperiodic Sturmian words and morphisms
• Infinite periodic words and almost nilpotent varieties
• Entropie polynomiale des homéomorphismes de Brouwer. Polynomial entropy of Brouwer homeomorphisms
• Constructing partial words with subword complexities not achievable by full words
• Nonfree almost finite actions for locally finite-by-virtually \(\mathbb{Z}\) groups
• Abelian antipowers in infinite words
• On the infinite permutation generated by the period doubling word
• Uniform sets and complexity
• On Growth and Fluctuation of k-Abelian Complexity
• Infinite self-shuffling words
• On the partitions with Sturmian-like refinements
• The weak circular repetition threshold over large alphabets
• A note on the nuclear dimension of Cuntz–Pimsner -algebras associated with minimal shift spaces
• Words with unbounded periodicity complexity
• Title not available (Why is that?)
• Language structure of pattern Sturmian words
• ALGORITHMIC COMBINATORICS ON PARTIAL WORDS
• On automorphism groups of Toeplitz subshifts
• Properties of a class of Toeplitz words
• On possible growths of arithmetical complexity
• Subshifts with slow complexity and simple groups with the Liouville property
• On maximal pattern complexity of some automatic words
• Weak abelian periodicity of infinite words
• On abelian versions of critical factorization theorem
• Sequences of low arithmetical complexity
• Bracket words: A generalisation of Sturmian words arising from generalised polynomials
• String attractors and infinite words
• On growth and fluctuation of \(k\)-abelian complexity

This page was built for publication: Toeplitz words, generalized periodicity and periodically iterated morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362993)