A new example for minimality of monoids

Basit Öğe Kaydı
dc.contributor.authorAteş F.
dc.contributor.authorKarpuz E.G.
dc.contributor.authorGüngör A.D.
dc.contributor.authorÇevik A.S.
dc.date.accessioned2020-03-26T18:05:55Z
dc.date.available2020-03-26T18:05:55Z
dc.date.issued2010
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractBy considering the split extension of a free abelian monoid having finite rank by a finite monogenic monoid, the main purposes of this paper are to present examples of efficient monoids and, also, minimal but inefficient monoids. Although results presented in this paper seem as in the branch of pure mathematics, they are actually related to applications of Combinatorial and Geometric Group-Semigroup Theory, especially computer science, network systems, cryptography and physics etc., which will not be handled here. © 2010 World Scientific Publishing Company.en_US
dc.identifier.doi10.1142/S1793557110000416en_US
dc.identifier.endpage544en_US
dc.identifier.issn1793-5571en_US
dc.identifier.issue4en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage531en_US
dc.identifier.urihttps://dx.doi.org/10.1142/S1793557110000416
dc.identifier.urihttps://hdl.handle.net/20.500.12395/25572
dc.identifier.volume3en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.relation.ispartofAsian-European Journal of Mathematicsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectEfficiencyen_US
dc.subjectminimalityen_US
dc.subjectmonogenic monoidsen_US
dc.subjectsplit extensionsen_US
dc.titleA new example for minimality of monoidsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu