Abstract
A special monoid is a monoid presented by generators and defining relations of the form w = e, where w is a non-empty word on generators and e is the empty word. Groups are special monoids. But there exist special monoids that are not groups. Special monoids have been extensively studied by Adjan[1] and Makanin[7] (see also [2]).
Publisher
Cambridge University Press (CUP)
Reference12 articles.
1. Decision problems for finite special string-rewriting systems that are confluent on a given congruence class;Otto;Ada Inform.,1991
2. Conjugacy in special monoids
3. Special monoids and special thue systems
4. On the word problem for finitely presented semigroups;Makanin;Dokl. Akad. Nauk SSSR,1966
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献