𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The finiteness of finitely presented monoids

✍ Scribed by Robert McNaughton

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
976 KB
Volume
204
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

This paper is dedicated to the memory of Marco Schiitzenberger, the one most responsible for impressing upon me the importance of monoids.

πŸ“œ SIMILAR VOLUMES

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

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