Pages that link to "Item:Q388457"
From MaRDI portal
The following pages link to Introducing privileged words: privileged complexity of Sturmian words (Q388457):
Displaying 21 items.
- A characterization of subshifts with bounded powers (Q394287) (← links)
- On palindromic factorization of words (Q394756) (← links)
- A metric characterisation of repulsive tilings (Q745672) (← links)
- Upper bound for the number of privileged words (Q2092391) (← links)
- On closed-rich words (Q2117106) (← links)
- Binomial complexities and Parikh-collinear morphisms (Q2164005) (← links)
- Abelian periods of factors of Sturmian words (Q2187128) (← links)
- Standard words and solutions of the word equation \(X_1^2\cdots X_n^2=(X_1\cdots X_n)^2\) (Q2221815) (← links)
- More on the dynamics of the symbolic square root map (Q2285121) (← links)
- Upper bound for the number of closed and privileged words (Q2294441) (← links)
- Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes (Q2354723) (← links)
- Open and closed factors in Arnoux-Rauzy words (Q2423399) (← links)
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences (Q2635089) (← links)
- Remarks on Privileged Words (Q3186046) (← links)
- On $k$-abelian equivalence and generalized Lagrange spectra (Q3298856) (← links)
- Improved estimates for the number of privileged words (Q4639881) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- Finite and infinite closed-rich words (Q6140350) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)
- Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents (Q6201925) (← links)
- Asymptotic bounds for the number of closed and privileged words (Q6574384) (← links)
