Pages that link to "Item:Q544139"
From MaRDI portal
The following pages link to Recurrent words with constant abelian complexity (Q544139):
Displaying 20 items.
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Abelian repetitions in partial words (Q651057) (← links)
- On the \(k\)-abelian complexity of the Cantor sequence (Q1689047) (← 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)
- Recursively renewable words and coding of irrational rotations (Q2468459) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← 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)
- Ultimately constant abelian complexity of infinite words (Q3589628) (← links)
- (Q3714481) (← links)
- (Q4637119) (← links)
- Abelian maximal pattern complexity of words (Q5175078) (← links)
- Sturmian words and constant additive complexity (Q5262049) (← links)
- Recurrent Partial Words and Representable Sets. (Q5267519) (← links)
- Templates for the \(k\)-binomial complexity of the Tribonacci word (Q5919292) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- 2-balanced sequences coding rectangle exchange transformation (Q6661759) (← links)