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: | Asri, Muhammad Sufi Mohd, Othman, Wan Ainun Mior, Wong, Kok Bin |
---|---|
Format: | Article |
Published: |
SPRINGER
2023
|
Subjects: | |
Online Access: | http://eprints.um.edu.my/39631/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Parsing algorithms for grammars with regulated rewriting
by: Turaev, Sherzod, et al.
Published: (2011) -
Improved coefficient recovery and its application for rewritable data embedding
by: Sii, Alan, et al.
Published: (2021) -
Variants Of Array-Rewriting P Systems For Generating Picture Arrays
by: Pradeep , Isawasan
Published: (2015) -
Rewritable data embedding in image based on improved coefficient recovery
by: Sii, Alan, et al.
Published: (2021) -
On certain sum involving quadratic residue
by: Sim, Kai An, et al.
Published: (2022)