Maximal pattern complexity of two-dimensional words
From MaRDI portal
Publication:2503281
DOI10.1016/j.tcs.2006.02.023zbMath1099.68050MaRDI QIDQ2503281
Teturo Kamae, Hui Rao, 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
Related Items
Maximal pattern complexity, dual system and pattern recognition, Behavior of various complexity functions, Maximal pattern complexity of higher dimensional words, Uniform sets and complexity, Language structure of pattern Sturmian words, Partitions by congruent sets and optimal positions, Uniform sets and super-stationary sets over general alphabets
Cites Work
- 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
- The rectangle complexity of functions on two-dimensional lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
