On algorithmic decidability of the square-free word problem relative to a system of two defining relations
Logic
2012-03-05 v1
Abstract
The square-free word problem relative to a system of two defining relations is decidable.
Keywords
Cite
@article{arxiv.1203.0334,
title = {On algorithmic decidability of the square-free word problem relative to a system of two defining relations},
author = {Nikolay L. Poliakov},
journal= {arXiv preprint arXiv:1203.0334},
year = {2012}
}