Circular words and applications
Formal Languages and Automata Theory
2011-08-19 v1 Combinatorics
Abstract
We define the notion of circular words, then consider on such words a constraint derived from the Fibonacci condition. We give several results on the structure of these circular words, then mention possible applications to various situations: periodic expansion of numbers in numeration systems, "gcd-property" of integer sequences, partition of the prefix of the fixed point of the Fibonacci substitution, spanning trees of a wheel. Eventually, we mention some open questions.
Cite
@article{arxiv.1108.3618,
title = {Circular words and applications},
author = {Benoît Rittaud and Laurent Vivier},
journal= {arXiv preprint arXiv:1108.3618},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412