The following pages link to Lyndon words and Fibonacci numbers (Q392802):
Displaying 11 items.
- On generating binary words palindromically (Q472173) (← links)
- Abelian bordered factors and periodicity (Q499493) (← links)
- The sequence of return words of the Fibonacci sequence (Q501001) (← links)
- Abelian periods of factors of Sturmian words (Q2187128) (← links)
- Monomial algebras defined by Lyndon words. (Q2253027) (← links)
- More properties of the Fibonacci word on an infinite alphabet (Q2330118) (← links)
- Studies on finite Sturmian words (Q2354408) (← links)
- Some properties of the Fibonacci sequence on an infinite alphabet (Q2363115) (← links)
- Counting Lyndon factors (Q2401409) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- ENUMERATING NECKLACES WITH TRANSITIONS (Q5023499) (← links)
