Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey
نویسندگان
چکیده
In recent years a number of conditions has been established that a monoid must necessarily satisfy if it is to have a presentation through some nite convergent string-rewriting system. Here we give a survey on this development, explaining these necessary conditions in detail and describing the relationships between them.
منابع مشابه
Innnite Convergent String-rewriting Systems and Cross-sections for Monoids
A nitely 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, context-free cross-sections or even regular cross-sections do not suuce. This is shown by presenting examples of nitely presented monoids with decidable word problems that do not admit regula...
متن کاملA Polygraphic Survey on Finiteness Conditions for Rewriting Systems
In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he has constructed finitely presented decidable monoids that cannot be presented by finite convergent rewriting systems. In 1994, Squier introduced the condition of finite derivation type, which is a h...
متن کاملPolygraphs of finite derivation type
Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he constructed finitely presentable monoids with a decidable word problem, but that cannot be presented by finite convergent rewriting systems. Later, he introduced the condition of finite derivation type, whic...
متن کاملSome Remarks on Nitely Presented Monoids with Automatic Structure
Groups with automatic structure (automatic groups for short) have recently received a lot of attention in the literature. They have been shown to have many nice properties, and consequently it has been asked whether these results can be carried over to monoids with automatic structure. Here we show that there exist nitely presented monoids with automatic structure that cannot be presented throu...
متن کاملFp 1 Is Undecidable for Nitely Presented Monoids with Word Problems Decidable in Polynomial Time
In the rst part of this paper properties P of nitely presented monoids are considered that satisfy the following two conditions: (1) each monoid that can be presented through a nite convergent string-rewriting system has property P , and (2) each nitely presented monoid having property P is of homology type FP3. Following an idea presented in (Otto and Sattler-Klein 1997) it is shown that these...
متن کامل