Sticker systems over permutation groups
Sticker systems were first introduced as a language generating device based on the operation of sticking. A new molecule is produced from the starting axiom, which is prolonged to the left or to the right using given single stranded strings or dominoes. For each sticker operation, an element of a gr...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IDOSI Publications
2013
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/44357/ http://psasir.upm.edu.my/id/eprint/44357/1/Sticker%20systems%20over%20permutation%20groups.pdf |
| _version_ | 1848850433561329664 |
|---|---|
| author | Mohd Sebry, Nurul Afidah Sarmin, Nor Haniza Fong, Wan Heng Turaev, Sherzod |
| author_facet | Mohd Sebry, Nurul Afidah Sarmin, Nor Haniza Fong, Wan Heng Turaev, Sherzod |
| author_sort | Mohd Sebry, Nurul Afidah |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Sticker systems were first introduced as a language generating device based on the operation of sticking. A new molecule is produced from the starting axiom, which is prolonged to the left or to the right using given single stranded strings or dominoes. For each sticker operation, an element of a group (called valence) will be associated with the axioms and dominoes and then the value of the group operation of the newly produced string is computed. Valence grammars were introduced as grammars with regulated rewriting using permutation groups and groups as control mechanisms. The definition for valence grammar is later extended to valence H systems which associate integer numbers with strings and the values associated with the result of newly produced strings are computed. A complete double stranded molecule is considered to be valid if the computation of the associated element produces the identity element. However, the converse is not true. Using the idea from the definition of valence H system and extended valence H system, the concept of valence sticker system over permutation groups is introduced in this research and the computational power of the language produced is also investigated. |
| first_indexed | 2025-11-15T10:06:13Z |
| format | Article |
| id | upm-44357 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:06:13Z |
| publishDate | 2013 |
| publisher | IDOSI Publications |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-443572020-07-10T01:52:10Z http://psasir.upm.edu.my/id/eprint/44357/ Sticker systems over permutation groups Mohd Sebry, Nurul Afidah Sarmin, Nor Haniza Fong, Wan Heng Turaev, Sherzod Sticker systems were first introduced as a language generating device based on the operation of sticking. A new molecule is produced from the starting axiom, which is prolonged to the left or to the right using given single stranded strings or dominoes. For each sticker operation, an element of a group (called valence) will be associated with the axioms and dominoes and then the value of the group operation of the newly produced string is computed. Valence grammars were introduced as grammars with regulated rewriting using permutation groups and groups as control mechanisms. The definition for valence grammar is later extended to valence H systems which associate integer numbers with strings and the values associated with the result of newly produced strings are computed. A complete double stranded molecule is considered to be valid if the computation of the associated element produces the identity element. However, the converse is not true. Using the idea from the definition of valence H system and extended valence H system, the concept of valence sticker system over permutation groups is introduced in this research and the computational power of the language produced is also investigated. IDOSI Publications 2013 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/44357/1/Sticker%20systems%20over%20permutation%20groups.pdf Mohd Sebry, Nurul Afidah and Sarmin, Nor Haniza and Fong, Wan Heng and Turaev, Sherzod (2013) Sticker systems over permutation groups. World Applied Sciences Journal, 21. pp. 119-126. ISSN 1818-4952; ESSN: 1991-6426 https://www.idosi.org/wasj/wasj21(am)2013.htm 10.5829/idosi.wasj.2013.21.am.21133 |
| spellingShingle | Mohd Sebry, Nurul Afidah Sarmin, Nor Haniza Fong, Wan Heng Turaev, Sherzod Sticker systems over permutation groups |
| title | Sticker systems over permutation groups |
| title_full | Sticker systems over permutation groups |
| title_fullStr | Sticker systems over permutation groups |
| title_full_unstemmed | Sticker systems over permutation groups |
| title_short | Sticker systems over permutation groups |
| title_sort | sticker systems over permutation groups |
| url | http://psasir.upm.edu.my/id/eprint/44357/ http://psasir.upm.edu.my/id/eprint/44357/ http://psasir.upm.edu.my/id/eprint/44357/ http://psasir.upm.edu.my/id/eprint/44357/1/Sticker%20systems%20over%20permutation%20groups.pdf |