Pages that link to "Item:Q984024"

The following pages link to Balance and abelian complexity of the Tribonacci word (Q984024):

Displaying 20 items.

• Initial non-repetitive complexity of infinite words (Q284845) (← 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)
• Relations on words (Q505060) (← links)
• Abelian complexity of infinite words associated with quadratic Parry numbers (Q653315) (← links)
• On the additive complexity of a Thue-Morse-like sequence (Q1741501) (← links)
• On the abelian complexity of the Rudin-Shapiro sequence (Q2408601) (← links)
• On the abelian complexity of generalized Thue-Morse sequences (Q2420616) (← links)
• Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
• BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS (Q2842015) (← links)
• Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224) (← links)
• Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words (Q3060201) (← links)
• Mechanical Proofs of Properties of the Tribonacci Word (Q3449367) (← links)
• Abelian Complexity and Synchronization (Q4987418) (← links)
• Templates for the \(k\)-binomial complexity of the Tribonacci word (Q5919292) (← links)
• The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (Q6097068) (← links)
• Abelian combinatorics on words: a survey (Q6101322) (← links)
• Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)