Circular words and applications
Benoît Rittaud, Laurent Vivier
Electronic Proceedings in Theoretical Computer Science · 2011
doi:10.4204/eptcs.63.6 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY-NC-ND
References3
3 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.