2000 character limit reached
On the Number of Unbordered Factors
Published 6 Nov 2012 in cs.FL, cs.DM, and math.CO | (1211.1301v1)
Abstract: We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We show that f(n) <= n for n >= 4 and that f(n) = n infinitely often. We also give examples of automatic sequences having exactly 2 unbordered factors of every length.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.