SOME PROPERTIES OF A CLASS OF POLYHEDRAL SEMIGROUPS BASED UPON THE SUBWORD REVERSING METHOD

dc.contributor.authorMinisker, M.
dc.date.accessioned2024-09-18T20:54:22Z
dc.date.available2024-09-18T20:54:22Z
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 vertical bar a(2n) = b(2n) = (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.en_US
dc.identifier.endpage63en_US
dc.identifier.issn1017-060X
dc.identifier.issn1735-8515
dc.identifier.issue1en_US
dc.identifier.startpage57en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12483/11766
dc.identifier.volume41en_US
dc.identifier.wosWOS:000351948600004en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherSpringer Singapore Pte Ltden_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.subjectPolyhedral semigroupen_US
dc.subjectcompleteen_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

Orijinal paket
Listeleniyor 1 - 1 / 1
[ N/A ]
Ä°sim:
Tam Metin / Full Text
Boyut:
91.51 KB
Biçim:
Adobe Portable Document Format