Note on occurrences of factors in circular words

Arnoux, Pierre

doi:10.1051/ita/2016019

Arnoux, Pierre ¹

¹Institute of mathematics, CNRS UPR 9016, Marseille, France.

RAIRO. Theoretical Informatics and Applications, Tome 50 (2016) no. 2, pp. 167-170

Résumé

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.

Reçu le : 2016-06-12
Accepté le : 2016-09-05

MR Zbl

DOI : 10.1051/ita/2016019

Classification : 68R15
Keywords: Circular words, factors, De Bruijn graphs

Affiliations des auteurs :

Arnoux, Pierre ¹

¹ Institute of mathematics, CNRS UPR 9016, Marseille, France.

@article{ITA_2016__50_2_167_0,
     author = {Arnoux, Pierre},
     title = {Note on occurrences of factors in circular words},
     journal = {RAIRO. Theoretical Informatics and Applications},
     pages = {167--170},
     year = {2016},
     publisher = {EDP-Sciences},
     volume = {50},
     number = {2},
     doi = {10.1051/ita/2016019},
     mrnumber = {3580109},
     zbl = {1429.68200},
     language = {en},
     url = {https://www.numdam.org/articles/10.1051/ita/2016019/}
}

TY  - JOUR
AU  - Arnoux, Pierre
TI  - Note on occurrences of factors in circular words
JO  - RAIRO. Theoretical Informatics and Applications
PY  - 2016
SP  - 167
EP  - 170
VL  - 50
IS  - 2
PB  - EDP-Sciences
UR  - https://www.numdam.org/articles/10.1051/ita/2016019/
DO  - 10.1051/ita/2016019
LA  - en
ID  - ITA_2016__50_2_167_0
ER  -

%0 Journal Article
%A Arnoux, Pierre
%T Note on occurrences of factors in circular words
%J RAIRO. Theoretical Informatics and Applications
%D 2016
%P 167-170
%V 50
%N 2
%I EDP-Sciences
%U https://www.numdam.org/articles/10.1051/ita/2016019/
%R 10.1051/ita/2016019
%G en
%F ITA_2016__50_2_167_0

Arnoux, Pierre. Note on occurrences of factors in circular words. RAIRO. Theoretical Informatics and Applications, Tome 50 (2016) no. 2, pp. 167-170. doi: 10.1051/ita/2016019

Bibliographie
Cité par

J. Cassaigne, Private communication.

J. Cassaigne, J. Karhumäki and A. Saarela, On growth and fluctuation of $k$ -abelian complexity, Proc. of the 10th CSR. In Vol. 9139 of Lect. Notes Comput. Sci. Springer (2015) 109–122. | MR

A. Costa, Solution for the problem of the game heads or tails. Available at (2010). | arXiv

P. Deligne, letter to Xavier Grandsart.

M. Younan, Letter to Xavier Grandsart.

Cité par Sources :