Pages that link to "Item:Q2581466"
From MaRDI portal
The following pages link to Maximal pattern complexity of words over \(\ell\) letters (Q2581466):
Displaying 11 items.
- Maximal pattern complexity, dual system and pattern recognition (Q714854) (← links)
- Behavior of various complexity functions (Q764361) (← links)
- Uniform sets and complexity (Q1043538) (← links)
- Language structure of pattern Sturmian words (Q2502894) (← links)
- Maximal pattern complexity of two-dimensional words (Q2503281) (← links)
- Partitions by congruent sets and optimal positions (Q3002605) (← links)
- Uniform sets and super-stationary sets over general alphabets (Q3093791) (← links)
- On possible growths of arithmetical complexity (Q3421906) (← links)
- Sturmian and Episturmian Words (Q3522857) (← links)
- Abelian maximal pattern complexity of words (Q5175078) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
