Geodesic
>On Word Chains
Séminaire lotharingien de combinatoire, Tome 17 (1987) Cet article a éte moissonné depuis la source Séminaire Lotharingien de Combinatoire website

Voir la notice de l'acte

Word chains are an extension of addition chains to words. Over a q-letter alphabet, any long enough word admits a word chain of length at most (l+ε)n/logq(n), for a fixed and arbitrary ε>0; moreover, there exist words with no chain shorter than n/logq-1(n). We study word chains for the Thue-Morse M word with a representation by binary trees. A conjecture on the enumeration of shortest word chains computing M is proposed. 

@article{SLC_1987_17_a5,
     author = {Sre\v{c}ko Brlek},
     title = {>On {Word} {Chains}},
     journal = {S\'eminaire lotharingien de combinatoire},
     year = {1987},
     volume = {17},
     url = {http://geodesic.mathdoc.fr/item/SLC_1987_17_a5/}
}
TY  - JOUR
AU  - Srečko Brlek
TI  - >On Word Chains
JO  - Séminaire lotharingien de combinatoire
PY  - 1987
VL  - 17
UR  - http://geodesic.mathdoc.fr/item/SLC_1987_17_a5/
ID  - SLC_1987_17_a5
ER  - 
%0 Journal Article
%A Srečko Brlek
%T >On Word Chains
%J Séminaire lotharingien de combinatoire
%D 1987
%V 17
%U http://geodesic.mathdoc.fr/item/SLC_1987_17_a5/
%F SLC_1987_17_a5
Srečko Brlek. >On Word Chains. Séminaire lotharingien de combinatoire, Tome 17 (1987). http://geodesic.mathdoc.fr/item/SLC_1987_17_a5/