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):
Displayed 4 items.
- An explicit lower bound for the block complexity of an algebraic number (Q993423) (← links)
- Describing the Set of Words Generated by Interval Exchange Transformation (Q3579923) (← links)
- Quasi-Sturmian colorings on regular trees (Q5131222) (← links)
- ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS (Q5389117) (← links)