Uniformly bounded duplication codes
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 41 (2007) no. 4, pp. 411-424.

Voir la notice de l'article dans Numdam

Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word’s duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of duplication code. Elementary properties are stated, then the conditions under which infinite duplication codes exist are fully characterized; the relevant parameters are the duplication length and alphabet size. Finally, some properties of the languages generated by duplication codes are investigated.

DOI : 10.1051/ita:2007021
Classification : 68R15, 68Q45, 94B60
Mots-clés : duplication, duplication primitive word, duplication root, duplication code 
@article{ITA_2007__41_4_411_0,
     author = {Leupold, Peter and Mitrana, Victor},
     title = {Uniformly bounded duplication codes},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {411--424},
     publisher = {EDP-Sciences},
     volume = {41},
     number = {4},
     year = {2007},
     doi = {10.1051/ita:2007021},
     mrnumber = {2377971},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2007021/}
}
TY  - JOUR
AU  - Leupold, Peter
AU  - Mitrana, Victor
TI  - Uniformly bounded duplication codes
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2007
SP  - 411
EP  - 424
VL  - 41
IS  - 4
PB  - EDP-Sciences
UR  - https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2007021/
DO  - 10.1051/ita:2007021
LA  - en
ID  - ITA_2007__41_4_411_0
ER  - 
%0 Journal Article
%A Leupold, Peter
%A Mitrana, Victor
%T Uniformly bounded duplication codes
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2007
%P 411-424
%V 41
%N 4
%I EDP-Sciences
%U https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2007021/
%R 10.1051/ita:2007021
%G en
%F ITA_2007__41_4_411_0
Leupold, Peter; Mitrana, Victor. Uniformly bounded duplication codes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 41 (2007) no. 4, pp. 411-424. doi : 10.1051/ita:2007021. https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2007021/

Cité par Sources :