Finite Complete Rewriting Systems for the Monoids M, ρ, and M/ρ

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi
Volume:6 Issue:1
Finite Complete Rewriting Systems for the Monoids M, ρ, and M/ρ

Finite Complete Rewriting Systems for the Monoids M, ρ, and M/ρ

Authors : Aykut EMNİYET, Basri ÇALIŞKAN

Pages : 720-725

Doi:10.47495/okufbed.1093331

View : 35 | Download : 9

Publication Date : 2023-03-10

Article Type : Research Paper

Abstract :Let ???? be a monoid and ???? be an equivalence relation on ???? such that ???? is a congruence. So, ???? is a submonoid of the direct product of monoids ????×????, and ????/????={????????:????∈????} is a monoid with the operation insert ignore into journalissuearticles values(????????);insert ignore into journalissuearticles values(????????);=insert ignore into journalissuearticles values(????????);????. First, an introductory lemma is proposed, proved and a relevant example is given. Then, it is shown that if ???? can be presented by a finite complete rewriting system, then so can ????. As the final part of the main result, it is proved that if ???? can be presented by a finite complete rewriting system, then so can ????/????.
Keywords : Yarıgruplar, Monoidler, Takdimler, Kongruanslar, Yeniden Yazma Sistemleri

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.