More properties of the Fibonacci word on an infinite alphabet

DOI10.1016/j.tcs.2019.07.011zbMath1435.68251arXiv1710.02782OpenAlexW2962735768WikidataQ127589583 ScholiaQ127589583MaRDI QIDQ2330118

W. F. Smyth, Amy Glen, R. Jamie Simpson

Publication date: 18 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.02782

zbMATH Keywords

squarepalindromeFibonacci wordLyndon word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

On square factors and critical factors of \(k\)-bonacci words on infinite alphabet ⋮ Some properties of the \(k\)-bonacci words on infinite alphabet

Cites Work

• Unnamed Item
• Lyndon words and Fibonacci numbers
• The exact number of squares in Fibonacci words
• A characterization of the squares in a Fibonacci string
• Lyndon words, permutations and trees.
• Detecting leftmost maximal periodicities
• Some properties of the Fibonacci sequence on an infinite alphabet
• The “Runs” Theorem
• Linear-time Suffix Sorting - A New Approach for Suffix Array Construction.
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: More properties of the Fibonacci word on an infinite alphabet