Maximal pattern complexity for Toeplitz words

DOI10.1017/S0143385706000150MaRDI QIDQ5395394zbMATH OpenOpenAlexFDO

Authors Nertila Gjini, Teturo Kamae, Tan Bo, Yu-Mei Xue

Publication date 30 October 2006

Published in Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0143385706000150

zbMATH Keywords

maximal pattern complexitypattern SturmianspectrumToeplitz words

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Combinatorics on words (68R15)

Recommendations

• Maximal pattern complexity of words over \(\ell\) letters
• Sequence entropy and the maximal pattern complexity of infinite words
• On maximal pattern complexity of some automatic words
• Two dimensional word with \(2k\) maximal pattern complexity
• Abelian maximal pattern complexity of words

Cited in

(13)

• Toeplitz words, generalized periodicity and periodically iterated morphisms
• Complexity of Toeplitz sequences
• Language structure of pattern Sturmian words
• Properties of a class of Toeplitz words
• Partitions by congruent sets and optimal positions
• Uniform sets and super-stationary sets over general alphabets
• On maximal pattern complexity of some automatic words
• Arithmetical closure of two-dimensional Toeplitz words
• Maximal pattern complexity for discrete systems
• Combinatorics of one-dimensional simple Toeplitz subshifts
• Abelian maximal pattern complexity of words
• Toeplitz words, generalized periodicity and periodically iterated morphisms
• Maximal pattern complexity of higher dimensional words

This page was built for publication: Maximal pattern complexity for Toeplitz words

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