Geodesic
On the additive complexity of partially commutative words
Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 4, pp. 40-50.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2005_12_4_a2,
     author = {Yu. V. Merekin},
     title = {On the additive complexity of partially commutative words},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {40--50},
     publisher = {mathdoc},
     volume = {12},
     number = {4},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2005_12_4_a2/}
}
TY  - JOUR
AU  - Yu. V. Merekin
TI  - On the additive complexity of partially commutative words
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2005
SP  - 40
EP  - 50
VL  - 12
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2005_12_4_a2/
LA  - ru
ID  - DA_2005_12_4_a2
ER  - 
%0 Journal Article
%A Yu. V. Merekin
%T On the additive complexity of partially commutative words
%J Diskretnyj analiz i issledovanie operacij
%D 2005
%P 40-50
%V 12
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2005_12_4_a2/
%G ru
%F DA_2005_12_4_a2
Yu. V. Merekin. On the additive complexity of partially commutative words. Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 4, pp. 40-50. http://geodesic.mathdoc.fr/item/DA_2005_12_4_a2/

[1] Merekin Yu. V., “Nizhnyaya otsenka slozhnosti dlya skhem konkatenatsii slov”, Diskret. analiz i issled. operatsii, 3:1 (1996), 52–56 | MR | Zbl

[2] Merekin Yu. V., “O porozhdenii slov s ispolzovaniem operatsii kompozitsii”, Diskret. analiz i issled. operatsii. Ser. 1, 10:4 (2003), 70–78 | MR | Zbl

[3] Bokut L. A., Shiao L.-S., “Gröbner–Shirshov bases for Coxeter groups”, Commun. in Algebra, 29:9 (2001), 4305–4319 | DOI | MR | Zbl

[4] Esyp E. S., Kazatchkov I. V., Remeslennikov V. N., “Divisibility theory and complexity of algorithms for free partially commutative groups”, Contemp. Math., 378 (2005), 317–346 | MR

[5] Shallit J., Tromp J., “Subword complexity of generalized Thue–Morse word”, Inform. Process. Lett., 54:6 (1995), 313–316 | DOI | MR | Zbl