RAIRO-Theor. Inf. Appl.
Volume 50, Number 2, April-June 2016
|Page(s)||167 - 170|
|Published online||26 October 2016|
Note on occurrences of factors in circular words
Institute of mathematics, CNRS UPR
Accepted: 5 September 2016
We give an elementary proof of a property discovered by Xavier Grandsart: let W be a circular binary word; then the differences in the number of occurrences |W|0011 − |W|1100, |W|1101 − |W|1011 , |W|1010 − |W|0101 and |W|0100 − |W|0010 are equal; this property is easily generalized using the De Bruijn graph.
Mathematics Subject Classification: 68R15
Key words: Circular words / factors / De Bruijn graphs
© EDP Sciences 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.