Maximal pattern complexity of higher dimensional words

DOI10.1016/j.jcta.2009.07.002zbMath1228.05020OpenAlexW2039153695MaRDI QIDQ965228

Zhi-Ying Wen, Hui Rao, Yu-Mei Xue, Yan-Hui Qu

Publication date: 21 April 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2009.07.002

zbMATH Keywords

Toeplitz wordmaximal pattern complexity\(n\)-dimensional word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (4)

Combinatorics of one-dimensional simple Toeplitz subshifts ⋮ Uniform convergence of Schrödinger cocycles over simple Toeplitz subshift ⋮ Uniform convergence of Schrödinger cocycles over bounded Toeplitz subshift ⋮ Maximal pattern complexity, dual system and pattern recognition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics on patterns of a bidimensional Sturmian sequence
• Discrete planes, \({\mathbb Z}^2\)-actions, Jacobi-Perron algorithm and substitutions
• Two dimensional word with \(2k\) maximal pattern complexity
• Language structure of pattern Sturmian words
• Maximal pattern complexity of two-dimensional words
• Sequence entropy and the maximal pattern complexity of infinite words
• Maximal pattern complexity for discrete systems
• Maximal pattern complexity for Toeplitz words

This page was built for publication: Maximal pattern complexity of higher dimensional words