|
Contemporary Mathematics and Its Applications, 2013, Volume 88, Pages 84–90
(Mi cma372)
|
|
|
|
On the algorithmic decidability of the square-free word problem relative to a system of two defining relations
N. L. Poliakov Financial University under the Government of the Russian Federation, Moscow
Abstract:
We prove that the square-free word problem relative to a system of two defining relations is algorithmically decidable.
Citation:
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, 88 (2013), 84–90; Journal of Mathematical Sciences, 204:6 (2015), 800–807
Linking options:
https://www.mathnet.ru/eng/cma372 https://www.mathnet.ru/eng/cma/v88/p84
|
Statistics & downloads: |
Abstract page: | 62 | Full-text PDF : | 22 | References: | 1 |
|