Rewriting systems for some semigroup constructions
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
Whether some important algebraic constructions in semigroup theory has a finite complete rewriting system in which conditions is investigated. Let S be a semigroup and let T be a a large subsemigroup of S. It is shown that T has a finite complete rewriting system if and only if S has a finite complete rewriting system. Let S be an ideal extension of T by U, it is shown that if T and U are presented by finite complete rewriting systems then S is presented by a finite complete rewriting system. Let M be a monoid and let ρ be congruece on M as a submonoid of M×M, finally it is shown that if ρ has a finite complete rewriting system then so do M and M/ρ.
Author
Aykut Emniyet
Institution
How to Cite
Aykut Emniyet (Master Thesis). Rewriting systems for some semigroup constructions, 2015, Osmaniye Korkut Ata University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Osmaniye Korkut Ata University
- Mobbing and organizational silence: A research on energy sector employees(2013)
- Information technologies effects of the audit profession(2014)
- The effects of perceived social support and emotional intelligence on depression: Applied to students of Osmaniye Korkut Ata Universi̇ty(2014)
- The effect of decision making behaviours and burnout on employees' life quality(2014)
- Carbon mineralization in soils added leaves and roots of red beet, watermelon radish and red radish grown in Kadi̇rli̇ (Osmani̇ye)(2014)
- Isolation of α-amylase producing thermophilic Bacillus strains and partial characterization of the enzymes(2014)