A Short Proof of a Theorem of Adjan

DOI10.2307/2159285zbMath0758.20015OpenAlexW4211175799MaRDI QIDQ4022075

Louxin Zhang

Publication date: 17 January 1993

Full work available at URL: https://doi.org/10.2307/2159285

zbMATH Keywords

word problemrewritingone-relator special monoids

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)

Related Items (8)

On some algorithmic problems for groups and monoids ⋮ On the word problem for special monoids ⋮ Prefix monoids of groups and right units of special inverse monoids ⋮ The word problem for one-relation monoids: a survey ⋮ On one-relator monoids and one-relator groups ⋮ New results on the prefix membership problem for one-relator groups ⋮ Finite homotopy bases of one-relator monoids ⋮ On one-relator groups and units of special one-relation inverse monoids

Cites Work

• Unnamed Item
• Special monoids and special Thue systems

This page was built for publication: A Short Proof of a Theorem of Adjan