Pages that link to "Item:Q2503281"
From MaRDI portal
The following pages link to Maximal pattern complexity of two-dimensional words (Q2503281):
Displaying 16 items.
- Maximal pattern complexity, dual system and pattern recognition (Q714854) (← links)
- Behavior of various complexity functions (Q764361) (← links)
- Complexity of cutting words on regular tilings (Q854843) (← links)
- Maximal pattern complexity of higher dimensional words (Q965228) (← links)
- Uniform sets and complexity (Q1043538) (← links)
- On a conjecture on bidimensional words. (Q1874389) (← links)
- Two dimensional word with \(2k\) maximal pattern complexity (Q1885240) (← links)
- Aperiodic two-dimensional words of small abelian complexity (Q2327230) (← links)
- Language structure of pattern Sturmian words (Q2502894) (← links)
- Maximal pattern complexity of words over \(\ell\) letters (Q2581466) (← links)
- Partitions by congruent sets and optimal positions (Q3002605) (← links)
- REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS (Q3022005) (← links)
- (Q3077266) (← links)
- Uniform sets and super-stationary sets over general alphabets (Q3093791) (← links)
- Abelian maximal pattern complexity of words (Q5175078) (← links)
- Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes (Q5281579) (← links)