Pages that link to "Item:Q698629"
From MaRDI portal
The following pages link to On the minimal complexity of infinite words (Q698629):
Displaying 19 items.
- On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
- On minimal words with given subword complexity (Q1392298) (← links)
- Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\). (Q1426035) (← links)
- Episturmian words and episturmian morphisms (Q1605314) (← links)
- Infinite words with linear subword complexity (Q1824405) (← links)
- The subword complexity of a class of infinite binary words (Q2370831) (← links)
- Degrees of Infinite Words, Polynomials and Atoms (Q2817385) (← links)
- On Infinite Words Determined by L Systems (Q2849993) (← links)
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS (Q3021999) (← links)
- Quasiperiods, Subword Complexity and the Smallest Pisot Number (Q3178875) (← links)
- Drunken man infinite words complexity (Q3526419) (← links)
- (Q3792243) (← links)
- On infinite HD0L words having sparse letters (Q4464260) (← links)
- (Q4779155) (← links)
- RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS (Q4786324) (← links)
- (Q5089310) (← links)
- Two infinite words with cubic subword complexity (Q5132212) (← links)
- (Q5384332) (← links)
- Proof of a conjecture on word complexity (Q5952902) (← links)