Applying rewriting methods to special monoids

DOI10.1017/S0305004100071176zbMath0782.20049MaRDI QIDQ5288344

Louxin Zhang

Publication date: 10 March 1994

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

relationsgeneratorsword problemgroup of unitsfree productdivisibility problemspecial Thue systemsfinitely presented special monoid

Mathematics Subject Classification ID

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

Related Items (12)

SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID ⋮ On some algorithmic problems for groups and monoids ⋮ On the word problem for special monoids ⋮ On the descriptive power of special Thue systems ⋮ Prefix monoids of groups and right units of special inverse monoids ⋮ Generators and relations for subsemigroups via boundaries in Cayley graphs. ⋮ The word problem for one-relation monoids: a survey ⋮ COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS ⋮ Presentations for subgroups of monoids ⋮ On equations and first-order theory of one-relator monoids ⋮ Non-finitely generated maximal subgroups of context-free monoids ⋮ On one-relator groups and units of special one-relation inverse monoids

Cites Work

• Decision problems for finite special string-rewriting systems that are confluent on some congruence class
• Special monoids and special Thue systems
• Thue systems as rewriting systems
• Conjugacy in special monoids
• Units of special Church-Rosser monoids
• On theories with a combinatorial definition of 'equivalence'

This page was built for publication: Applying rewriting methods to special monoids