Pages that link to "Item:Q3549292"
From MaRDI portal
The following pages link to Palindromic complexity of infinite words associated with non-simple Parry numbers (Q3549292):
Displaying 14 items.
- On the least number of palindromes contained in an infinite word (Q385043) (← links)
- 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)
- Repetitions in beta-integers (Q1013635) (← links)
- Palindrome complexity bounds for primitive substitution sequences (Q1579570) (← links)
- Local symmetries in the period-doubling sequence (Q1962024) (← links)
- Palindromic complexity of infinite words associated with simple Parry numbers (Q2372771) (← links)
- Factor versus palindromic complexity of uniformly recurrent infinite words (Q2373751) (← links)
- A connection between palindromic and factor complexity using return words (Q2377963) (← 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 PALINDROMIC COMPLEXITY OF INFINITE WORDS (Q3021999) (← links)
- Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers (Q3182865) (← links)
- Complexity of infinite words associated with beta-expansions (Q4825393) (← links)