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
- Carbon mineralization in soil added Suillus collinitus growing naturally on two different altitudes(2020)
- Data mining methods used to determine financial statement frauds and an application in Borsa Istanbul(2021)
- Drying of oat milk pulp enriched with phenolic content by solid-state fermentation using different methods(2025)
- Analyzing recourse cases in social security law related to construction works accidents(2015)
- Determination of radon ( Rn-222 ) concentration in drinkable and processed water in and around osmaniye(2015)
- Fabry perot spectrometers and galactic hα observations(2015)
