Pages that link to "Item:Q3526422"
From MaRDI portal
The following pages link to Comparing Complexity Functions of a Language and Its Extendable Part (Q3526422):
Displaying 10 items.
- Growth properties of power-free languages (Q465700) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Avoiding square-free words on free groups (Q2672587) (← links)
- On Pnsiot words avoiding 3-repetitions (Q2841970) (← links)
- On Abelian repetition threshold (Q2911433) (← links)
- Two-Sided Bounds for the Growth Rates of Power-Free Languages (Q3637248) (← links)
- On the growth rates of complexity of threshold languages (Q5190085) (← links)
- A New Hierarchy for Automaton Semigroups (Q5859663) (← links)