Pages that link to "Item:Q544139"
From MaRDI portal
The following pages link to Recurrent words with constant abelian complexity (Q544139):
Displayed 11 items.
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- On the \(k\)-abelian complexity of the Cantor sequence (Q1689047) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- On the abelian complexity of the Rudin-Shapiro sequence (Q2408601) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
- Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words (Q3060201) (← links)
- Templates for the \(k\)-binomial complexity of the Tribonacci word (Q5919292) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- Minimal Complexities for Infinite Words Written with d Letters (Q6134858) (← links)
- On a Class of 2-Balanced Sequences (Q6134869) (← links)