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. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Goč, D., Mousavi, H., & Shallit, J. (2013). On the number of unbordered factors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7810 LNCS, pp. 299–310). Springer Verlag. https://doi.org/10.1007/978-3-642-37064-9_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
