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

DOI10.1007/S10958-015-2219-6MaRDI QIDQ893718zbMATHOpenAlexFDO

Authors N. L. Polyakov

Publication date 20 November 2015

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

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)

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

Cites work

• scientific article; zbMATH DE number 3479158 (Why is no real title available?)
• Avoidable patterns in strings of symbols
• 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)