Bulletin of the Iranian Mathematical Society, cilt.41, sa.1, ss.57-63, 2015 (SCI-Expanded)
In 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.