Maximal pattern complexity of higher dimensional words
From MaRDI portal
Recommendations
Cites work
- Combinatorics on patterns of a bidimensional Sturmian sequence
- Discrete planes, \({\mathbb Z}^2\)-actions, Jacobi-Perron algorithm and substitutions
- scientific article; zbMATH DE number 1400043 (Why is no real title available?)
- Language structure of pattern Sturmian words
- Maximal pattern complexity for discrete systems
- Maximal pattern complexity for Toeplitz words
- Maximal pattern complexity of two-dimensional words
- Palindromes and two-dimensional Sturmian sequences
- Sequence entropy and the maximal pattern complexity of infinite words
- Sequences of low complexity: Automatic and Sturmian sequences
- Two dimensional word with \(2k\) maximal pattern complexity
Cited in
(13)- Two dimensional word with \(2k\) maximal pattern complexity
- Recurrence in multidimensional words
- Uniform convergence of Schrödinger cocycles over simple Toeplitz subshift
- Maximal pattern complexity of two-dimensional words
- Maximal pattern complexity of words over \(\ell\) letters
- A family of two-dimensional words with maximal pattern complexity \(2k\)
- Uniform convergence of Schrödinger cocycles over bounded Toeplitz subshift
- Combinatorics of one-dimensional simple Toeplitz subshifts
- Abelian maximal pattern complexity of words
- Thickness, Toeplitz words, and orientation preserving Lipschitz classification of Moran sets
- Degree distribution and patches of the image horizontal visibility graph mapped from two-dimensional Thue-Morse words
- Maximal pattern complexity, dual system and pattern recognition
- Recurrence along directions in multidimensional words
This page was built for publication: Maximal pattern complexity of higher dimensional words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965228)
