Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-08-18
EPTCS 63, 2011, pp. 31-36
Computer Science
Formal Languages and Automata Theory
In Proceedings WORDS 2011, arXiv:1108.3412
Scientific paper
10.4204/EPTCS.63.6
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.
Rittaud Benoît
Vivier Laurent
No associations
LandOfFree
Circular words and applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Circular words and applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circular words and applications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-180561