Parity Index of Binary Words and Powers of Prime Words

Electronic Journal Of Combinatorics

Aleksandar Ilić¹ 

关键词: binary words;    combinatorics on words;    words avoiding a pattern;    parity index;    generalized Fibonacci cubes;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $f$ be a binary word and let ${\cal F}_d(f)$ be the set of words of length $d$ which do not contain $f$ as a factor (alias words that avoid the pattern $f$). A word is called even/odd if it contains an even/odd number of 1s. The parity index of $f$ (o

【 授权许可】

Others