Pages that link to "Item:Q4581961"
From MaRDI portal
The following pages link to On the character of words of sublinear complexity (Q4581961):
Displaying 21 items.
- Cyclic complexity of words (Q507796) (← links)
- On the minimal complexity of infinite words (Q698629) (← links)
- Context-free complexity of finite languages (Q792097) (← links)
- Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\). (Q1426035) (← links)
- Partitioned factors in Christoffel and Sturmian words (Q1659982) (← links)
- Infinite words with linear subword complexity (Q1824405) (← links)
- On non-repetitive complexity of Arnoux-Rauzy words (Q2197452) (← links)
- On the arithmetical complexity of Sturmian words (Q2373754) (← links)
- A lower bound for the arithmetical complexity of Sturmian words (Q2498100) (← links)
- Topological invariants for words of linear factor complexity (Q2672961) (← links)
- Subword complexity and periodicity in two or more dimensions (Q2708947) (← links)
- Subword complexity and Laurent series (Q2855524) (← links)
- A note on the decidability of subword inequalities (Q2856016) (← links)
- (Q3104403) (← links)
- An isolated point in the Heinis spectrum (Q3186673) (← links)
- Sequences of low arithmetical complexity (Q3423138) (← links)
- (Q4527151) (← links)
- (Q4830987) (← links)
- The Maximal Subword Complexity of Quasiperiodic Infinite Words (Q4964023) (← links)
- A characterization of words of linear complexity (Q5384833) (← links)
- The subword complexity of a two-parameter family of sequences (Q5942564) (← links)