Complete rewriting systems for codified submonoids

Research output: Contribution to journalArticle

Abstract

Given a complete rewriting system R on X and a subset X_0 of X^+ satisfying certain conditions, we present a complete rewriting system for the submonoid of M(X;R) generated by X_0. The obtained result will be applied to the group of units of a monoid satisfying H_1 = D_1. On the other hand we prove that all maximal subgroups of a monoid defined by a special rewriting system are isomorphic.
Original languageEnglish
Pages (from-to)207-216
Number of pages10
JournalInternational Journal Of Algebra And Computation
Volume15
Issue number2
DOIs
Publication statusPublished - Apr 2005

Keywords

  • Special rewriting system
  • Submonoid
  • Complete rewriting system
  • Maximal subgroup
  • Monoid

Fingerprint Dive into the research topics of 'Complete rewriting systems for codified submonoids'. Together they form a unique fingerprint.

  • Cite this