Divisibility problem for one relator monoids

DOI10.1016/J.TCS.2005.01.003MaRDI QIDQ557910zbMATH OpenOpenAlexFDO

Authors Sergey I. Adian

Publication date 30 June 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.01.003

zbMATH Keywords

algorithmmonoidword problemdefining relationdivisibility problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Word problems, etc. in computability and recursion theory (03D40)

Recommendations

• On the divisibility problem for one-relator monoids
• ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER
• Left-divisibility and word problems in single relation monoids
• Solution of the membership problem of the prefix monoid in certain one-relator groups.
• On the relationship between the problems of equality and divisibility of words for semigroups with a single defining relation

Cited in

(6)

• Left-divisibility and word problems in single relation monoids
• Finite transducers for divisibility monoids
• On the divisibility problem for one-relator monoids
• scientific article; zbMATH DE number 1839447 (Why is no real title available?)
• The word problem for one-relation monoids: a survey
• ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER

This page was built for publication: Divisibility problem for one relator monoids

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