Minisker, Melis2024-09-192024-09-1920151018-6301https://hdl.handle.net/20.500.12483/14802In 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.eninfo:eu-repo/semantics/closedAccessCompletePolyhedral semigroupPresentationSubword reversingSome properties of a class of polyhedral semigroups based upon the subword reversing methodArticle41157632-s2.0-84923045845Q2