Divisibility problem for one relator monoids

DOI10.1016/j.tcs.2005.01.003zbMath1070.03027OpenAlexW2075841735MaRDI QIDQ557910

S. I. Adyan

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

algorithmword problemdefining relationmonoiddivisibility problem

Mathematics Subject Classification ID

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

Related Items (1)

The word problem for one-relation monoids: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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