Pages that link to "Item:Q1292491"
From MaRDI portal
The following pages link to Complexity for finite factors of infinite sequences (Q1292491):
Displayed 9 items.
- Subword complexity of uniform D0L words over finite groups (Q719314) (← links)
- Asymptotic subword complexity of fixed points of group substitutions (Q1019186) (← links)
- Total palindrome complexity of finite words (Q1045150) (← links)
- Hierarchical structures in Sturmian dynamical systems (Q1401381) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Algorithms for subsequence combinatorics (Q2378518) (← links)
- On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
- Quasi-periodic continued fractions (Q2469146) (← links)
- (Q5132212) (← links)