Pages that link to "Item:Q3182865"
From MaRDI portal
The following pages link to Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers (Q3182865):
Displaying 11 items.
- Abelian complexity of infinite words associated with quadratic Parry numbers (Q653315) (← links)
- Complexity for infinite words associated with quadratic non-simple Parry numbers (Q874377) (← links)
- On low-complexity bi-infinite words and their factors (Q1606164) (← links)
- Palindromic complexity of infinite words associated with simple Parry numbers (Q2372771) (← links)
- On a class of infinite words with affine factor complexity (Q2465623) (← links)
- Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers (Q2855517) (← links)
- On the structure of \((-\beta )\)-integers (Q2911435) (← links)
- Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words (Q3060201) (← links)
- Palindromic complexity of infinite words associated with non-simple Parry numbers (Q3549292) (← links)
- Complexity of infinite words associated with beta-expansions (Q4825393) (← links)
- Complexity of Leading Digit Sequences (Q5130749) (← links)