Some properties of a class of polyhedral semigroups based upon the subword reversing method

Basit Öğe Kaydı
dc.authorscopusid6505656872
dc.contributor.authorMinisker, Melis
dc.date.accessioned2024-09-19T15:45:37Z
dc.date.available2024-09-19T15:45:37Z
dc.date.issued2015
dc.departmentHatay Mustafa Kemal Üniversitesien_US
dc.description.abstractIn this paper a certain class of polyhedral semigroups which has a presentation < a, b | a2n = b2n = (ab)n > is examined. The completeness of the presentation and solvability of word problem of this class of semigroups is determined. Moreover the combinatorial distance between two words is determined. © 2015 Iranian Mathematical Society.en_US
dc.identifier.endpage63en_US
dc.identifier.issn1018-6301
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-84923045845en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage57en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12483/14802
dc.identifier.volume41en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIranian Mathematical Societyen_US
dc.relation.ispartofBulletin of the Iranian Mathematical Societyen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectCompleteen_US
dc.subjectPolyhedral semigroupen_US
dc.subjectPresentationen_US
dc.subjectSubword reversingen_US
dc.titleSome properties of a class of polyhedral semigroups based upon the subword reversing methoden_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu