科研之友
微信
新浪微博
Facebook
分享链接
摘要
In 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.
- 出版日期2015-3
