Rewriting system of certain semigroups with three generators
In this paper, we study some properties of semigroups with presentation < a, b, c; a(p) = b(s), b(r) = c(v), c(u) = a(q). We will determine a complete rewriting system for the semigroup which could be useful for cryptosystems.
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Article |
| 出版: |
Springer
2023
|
| 主题: | |
| 在线阅读: | http://eprints.um.edu.my/39631/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
成为第一个发表评论!