On the algorithmic decidability of the square-free word problem relative to a system of two defining relations

DOI10.1007/S10958-015-2219-6zbMATH Open1343.68189arXiv1203.0334OpenAlexW2103013326MaRDI QIDQ893718FDOQ893718

Authors: N. L. Polyakov 

Publication date: 20 November 2015

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Abstract: The square-free word problem relative to a system of two defining relations is decidable.

Full work available at URL: https://arxiv.org/abs/1203.0334

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40)

Cites Work

• Avoidable patterns in strings of symbols
• Title not available (Why is that?)
• Non-repetitive words relative to a rewriting system

This page was built for publication: On the algorithmic decidability of the square-free word problem relative to a system of two defining relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893718)