Pages that link to "Item:Q2370831"
From MaRDI portal
The following pages link to The subword complexity of a class of infinite binary words (Q2370831):
Displaying 9 items.
- Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
- Subword complexity of a generalized Thue-Morse word (Q672966) (← links)
- On the expansion of some exponential periods in an integer base (Q2655152) (← links)
- Nombres réels de complexité sous-linéaire : mesures d'irrationalité et de transcendance (Q3094345) (← links)
- On the subword equivalence problem for infinite words (Q4596614) (← links)
- ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (Q4923275) (← links)
- The Maximal Subword Complexity of Quasiperiodic Infinite Words (Q4964023) (← links)
- A new estimate on complexity of binary generalized pseudostandard words (Q5384198) (← links)
- Dynamics for<i>β</i>-shifts and Diophantine approximation (Q5436446) (← links)