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
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CMA_2013_88_a7/
LA  - ru
ID  - CMA_2013_88_a7
ER  -