𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On finitely presented, cancellative and commutative ordered monoids

✍ Scribed by Yonglin Cao

Publisher
Springer
Year
2010
Tongue
English
Weight
322 KB
Volume
82
Category
Article
ISSN
0037-1912

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Infinite Convergent String-rewriting Sys
Infinite Convergent String-rewriting Systems and Cross-sections for Finitely Presented Monoids
✍ F. OTTO; M. KATSURA; Y. KOBAYASHI πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 635 KB

A finitely presented monoid has a decidable word problem if and only if it can be presented by some left-recursive convergent string-rewriting system if and only if it has a recursive cross-section. However, regular cross-sections or even context-free cross-sections do not suffice. This is shown by

For finitely presented monoids the homol
For finitely presented monoids the homological finiteness conditions FHT and bi-FP3 coincide
✍ Yuji Kobayashi; Friedrich Otto πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 149 KB

FHT is a homological finiteness condition of monoids that was introduced by Pride and Wang. For finitely presented groups this property is equivalent to the homological finiteness condition FP 3 , but for finitely presented monoids in general it is strictly stronger than the conditions left-FP 3 and