Maximal pattern complexity for Toeplitz words

DOI10.1017/S0143385706000150zbMath1108.68095OpenAlexW2078058503MaRDI QIDQ5395394

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

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

spectrumToeplitz wordsmaximal pattern complexitypattern Sturmian

Mathematics Subject Classification ID

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

Related Items (6)

Combinatorics of one-dimensional simple Toeplitz subshifts ⋮ Partitions by congruent sets and optimal positions ⋮ Maximal pattern complexity of higher dimensional words ⋮ Language structure of pattern Sturmian words ⋮ Uniform sets and super-stationary sets over general alphabets ⋮ On maximal pattern complexity of some automatic words

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