arXiv:2210.08629 [math.CO]AbstractReferencesReviewsResources
A Note On $\ell$-Rauzy Graphs for the Infinite Fibonacci Word
Published 2022-10-16Version 1
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,v_2)$ is formed if the concatenation of the word $v_1$ and the suffix of $v_2$ of length $k-\ell$ is a subword of the infinite word. In this paper, we consider one of the important aperiodic recurrent words, the infinite Fibonacci word for discussion. We prove a few basic properties of the $\ell$-Rauzy graph of the infinite Fibonacci word. We also prove that the $\ell$-Rauzy graphs for the infinite Fibonacci word are strongly connected.
Comments: 10 pages, 4 figures
Related articles: Most relevant | Search more
arXiv:1301.5104 [math.CO] (Published 2013-01-22)
On a generalization of Abelian equivalence and complexity of infinite words
arXiv:1905.04746 [math.CO] (Published 2019-05-12)
Generalized Lyndon Factorizations of Infinite Words
arXiv:2010.05518 [math.CO] (Published 2020-10-12)
Fibonacci-run graphs I: basic properties