Pages that link to "Item:Q3074533"
From MaRDI portal
The following pages link to Abelian complexity of minimal subshifts (Q3074533):
Displayed 50 items.
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Abelian properties of Parry words (Q484315) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Abelian bordered factors and periodicity (Q499493) (← links)
- Weak abelian periodicity of infinite words (Q504987) (← links)
- Relations on words (Q505060) (← links)
- Cyclic complexity of words (Q507796) (← links)
- A square root map on Sturmian words (Q521380) (← links)
- Recurrent words with constant abelian complexity (Q544139) (← links)
- Abelian complexity of infinite words associated with quadratic Parry numbers (Q653315) (← links)
- Eulerian entropy and non-repetitive subword complexity (Q764367) (← links)
- Weighted prefix normal words: mind the gap (Q832931) (← links)
- The Frobenius problem for homomorphic embeddings of languages into the integers (Q1637229) (← links)
- On the \(k\)-abelian complexity of the Cantor sequence (Q1689047) (← links)
- On the additive complexity of a Thue-Morse-like sequence (Q1741501) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Abelian antipowers in infinite words (Q2002043) (← links)
- On the 2-abelian complexity of generalized Cantor sequences (Q2087468) (← links)
- On balanced and abelian properties of circular words over a ternary alphabet (Q2098185) (← links)
- Lie complexity of words (Q2163386) (← links)
- Abelian periods of factors of Sturmian words (Q2187128) (← links)
- On the boundary sequence of an automatic sequence (Q2237216) (← links)
- Abelian closures of infinite binary words (Q2237936) (← links)
- Aperiodic two-dimensional words of small abelian complexity (Q2327230) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- On the abelian complexity of the Rudin-Shapiro sequence (Q2408601) (← links)
- On the abelian complexity of generalized Thue-Morse sequences (Q2420616) (← links)
- Open and closed factors in Arnoux-Rauzy words (Q2423399) (← links)
- A note on abelian returns in rotation words (Q2437858) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Abelian Complexity and Frequencies of Letters in Infinite Words (Q2833546) (← links)
- On abelian versions of critical factorization theorem (Q2911422) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
- Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words (Q3060201) (← links)
- Avoiding Three Consecutive Blocks of the Same Size and Same Sum (Q3189645) (← links)
- On $k$-abelian equivalence and generalized Lagrange spectra (Q3298856) (← links)
- Cototal enumeration degrees and their applications to effective mathematics (Q4563667) (← links)
- Abelian Complexity and Synchronization (Q4987418) (← links)
- The abelian complexity of infinite words and the Frobenius problem (Q4987432) (← links)
- (Q5089254) (← links)
- Separating the Words of a Language by Counting Factors (Q5158654) (← links)
- Abelian maximal pattern complexity of words (Q5175078) (← links)
- On a group theoretic generalization of the Morse-Hedlund theorem (Q5270140) (← links)
- Abelian Repetitions in Sturmian Words (Q5300843) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- On infinite prefix normal words (Q5919082) (← links)
- Properties of a ternary infinite word (Q6041042) (← links)
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (Q6097068) (← links)