Abstract
Recently the Fibonacci word W on an infinite alphabet was introduced by Zhang et al. (2017) [13] as a fixed point of the morphism ϕ:(2i)↦(2i)(2i+1),(2i+1)↦(2i+2) over all i∈N. In this paper we investigate the occurrence of squares, palindromes, and Lyndon factors in this infinite word.
Author supplied keywords
Cite
CITATION STYLE
APA
Glen, A., Simpson, J., & Smyth, W. F. (2019). More properties of the Fibonacci word on an infinite alphabet. Theoretical Computer Science, 795, 301–311. https://doi.org/10.1016/j.tcs.2019.07.011
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free