Minisker, M.2024-09-182024-09-1820151017-060X1735-8515https://hdl.handle.net/20.500.12483/11766In 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.eninfo:eu-repo/semantics/closedAccessPolyhedral semigroupcompletepresentationsubword reversingArticle4115763WOS:000351948600004Q4