Maximal pattern complexity of two-dimensional words

DOI10.1016/j.tcs.2006.02.023zbMath1099.68050OpenAlexW2113070578MaRDI QIDQ2503281

Hui Rao, Teturo Kamae, Yu-Mei Xue

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.02.023

zbMATH Keywords

strong recurrencetwo-dimensional wordsmaximal pattern complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (7)

Partitions by congruent sets and optimal positions ⋮ Maximal pattern complexity of higher dimensional words ⋮ Maximal pattern complexity, dual system and pattern recognition ⋮ Language structure of pattern Sturmian words ⋮ Uniform sets and super-stationary sets over general alphabets ⋮ Behavior of various complexity functions ⋮ Uniform sets and complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattices and multi-dimensional words
• Combinatorics on patterns of a bidimensional Sturmian sequence
• Balance properties of multi-dimensional words
• Discrete planes, \({\mathbb Z}^2\)-actions, Jacobi-Perron algorithm and substitutions
• On a conjecture on bidimensional words.
• Two dimensional word with \(2k\) maximal pattern complexity
• Maximal pattern complexity of words over \(\ell\) letters
• Sequence entropy and the maximal pattern complexity of infinite words
• Maximal pattern complexity for discrete systems
• Local Complexity of Delone Sets and Crystallinity
• The rectangle complexity of functions on two-dimensional lattices

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