Pages that link to "Item:Q1292491"
From MaRDI portal
The following pages link to Complexity for finite factors of infinite sequences (Q1292491):
Displaying 18 items.
- Subword complexity of uniform D0L words over finite groups (Q719314) (← links)
- Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions (Q952226) (← links)
- Asymptotic subword complexity of fixed points of group substitutions (Q1019186) (← links)
- Total palindrome complexity of finite words (Q1045150) (← links)
- Language complexity of rotations and Sturmian sequences (Q1274922) (← links)
- Modified complexity and *-Sturmian word (Q1302093) (← links)
- Complexity of sequences and dynamical systems (Q1304818) (← links)
- Sequences with subword complexity \(2n\) (Q1320503) (← links)
- On the complexity of infinite sequences (Q1326948) (← links)
- Hierarchical structures in Sturmian dynamical systems (Q1401381) (← links)
- Palindrome complexity. (Q1853729) (← links)
- The complexity of generalized Sturmian sequences (Q1922164) (← links)
- Algorithms for subsequence combinatorics (Q2378518) (← links)
- On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
- Quasi-periodic continued fractions (Q2469146) (← links)
- Production en temps réel et complexité de structure de suites infinies (Q4730778) (← links)
- Two infinite words with cubic subword complexity (Q5132212) (← links)
- The subword complexity of a two-parameter family of sequences (Q5942564) (← links)