Suffixes of Fibonacci Word Patterns
Wai-Fong Chuan, Chih‐Hao Chang, Yen-Liang Chang · The Fibonacci Quarterly · 2000
Let si be an alphabet. Let st be the monoid of all words over si. Let s denote the empty word, and let si + = si * \\{s}. Ifw = axa2...an, where at esi, the positive integer n is called the length of w, denoted by \\w\\. Let |£|=0. A word x is said to be & prefix (resp., suffix) of w, denoted by x <p w (resp., x