Finite complete rewriting systems and finite derivation type for small extensions of monoids (Q1270963)

From MaRDI portal
Revision as of 09:44, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Finite complete rewriting systems and finite derivation type for small extensions of monoids
scientific article

    Statements

    Finite complete rewriting systems and finite derivation type for small extensions of monoids (English)
    0 references
    0 references
    18 September 2000
    0 references
    \textit{N. Ruškuc} [Proc. Lond. Math. Soc., III. Ser. 76, No. 2, 383-405 (1998; Zbl 0891.20036)] studied finiteness conditions on semigroups. In the present paper, the author proves several results that solve part of an open problem posed by Ruškuc: if a semigroup can be presented by a finite complete rewriting system, then so can any small extension of that semigroup; and if a semigroup has finite derivation type, then so does any small extension of that semigroup.
    0 references
    word problem
    0 references
    finiteness conditions on semigroups
    0 references
    finite complete rewriting systems
    0 references
    small extensions
    0 references
    semigroups of finite derivation type
    0 references

    Identifiers