Pages that link to "Item:Q1426035"
From MaRDI portal
The following pages link to Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\). (Q1426035):
Displaying 8 items.
- An explicit lower bound for the block complexity of an algebraic number (Q993423) (← links)
- A note on symmetries in the Rauzy graph and factor frequencies (Q1029352) (← links)
- An isolated point in the Heinis spectrum (Q3186673) (← links)
- Describing the Set of Words Generated by Interval Exchange Transformation (Q3579923) (← links)
- Quasi-Sturmian colorings on regular trees (Q5131222) (← links)
- A characterization of words of linear complexity (Q5384833) (← links)
- ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS (Q5389117) (← links)
- Examples of sequences of complexity less than \(2n\) (Q5952897) (← links)