Geodesic
On the algorithmic decidability of the square-free word problem relative to a system of two defining relations
Contemporary Mathematics and Its Applications, Tome 88 (2013), pp. 84-90 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We prove that the square-free word problem relative to a system of two defining relations is algorithmically decidable. 
@article{CMA_2013_88_a7,
     author = {N. L. Poliakov},
     title = {On the algorithmic decidability of the square-free word problem relative to a system of two defining relations},
     journal = {Contemporary Mathematics and Its Applications},
     pages = {84--90},
     year = {2013},
     volume = {88},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/CMA_2013_88_a7/}
}
TY  - JOUR
AU  - N. L. Poliakov
TI  - On the algorithmic decidability of the square-free word problem relative to a system of two defining relations
JO  - Contemporary Mathematics and Its Applications
PY  - 2013
SP  - 84
EP  - 90
VL  - 88
UR  - http://geodesic.mathdoc.fr/item/CMA_2013_88_a7/
LA  - ru
ID  - CMA_2013_88_a7
ER  - 
%0 Journal Article
%A N. L. Poliakov
%T On the algorithmic decidability of the square-free word problem relative to a system of two defining relations
%J Contemporary Mathematics and Its Applications
%D 2013
%P 84-90
%V 88
%U http://geodesic.mathdoc.fr/item/CMA_2013_88_a7/
%G ru
%F CMA_2013_88_a7
N. L. Poliakov. On the algorithmic decidability of the square-free word problem relative to a system of two defining relations. Contemporary Mathematics and Its Applications, Tome 88 (2013), pp. 84-90. http://geodesic.mathdoc.fr/item/CMA_2013_88_a7/