Generative capacity of sticker systems with the presence of weights
DNA computing involves computing models which use the recombination behavior of DNA molecules as computation devices. This idea was successfully applied by Adleman in his biological experiment in order to show the solvability of the Hamiltonian path problem for larger instances. In 1998, a DNA based...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Science Society of Thailand under Royal Patronage
2017
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/53808/ http://irep.iium.edu.my/53808/1/53808_Generative%20capacity%20of%20sticker%20systems.pdf http://irep.iium.edu.my/53808/7/53808_Generative%20capacity%20of%20sticker%20systems_Scopus.pdf |
| _version_ | 1848784295457456128 |
|---|---|
| author | Gan, Yee Siang Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod |
| author_facet | Gan, Yee Siang Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod |
| author_sort | Gan, Yee Siang |
| building | IIUM Repository |
| collection | Online Access |
| description | DNA computing involves computing models which use the recombination behavior of DNA molecules as computation devices. This idea was successfully applied by Adleman in his biological experiment in order to show the solvability of the Hamiltonian path problem for larger instances. In 1998, a DNA based computation model, called sticker system, which is an abstraction of the computations using the recombination behavior as in Adleman’s experiment was proposed. In 2013, a new variant of sticker system using weights was introduced, namely the weighted sticker system. In this paper, the generative capacity for several variants of bounded delay and nonrestrictive weighted sticker systems are investigated. The relation between families of languages generated by several variants of weighted sticker systems and weighted grammars are also presented. |
| first_indexed | 2025-11-14T16:34:59Z |
| format | Article |
| id | iium-53808 |
| institution | International Islamic University Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-14T16:34:59Z |
| publishDate | 2017 |
| publisher | Science Society of Thailand under Royal Patronage |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | iium-538082021-06-15T07:36:19Z http://irep.iium.edu.my/53808/ Generative capacity of sticker systems with the presence of weights Gan, Yee Siang Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA Mathematics QA75 Electronic computers. Computer science DNA computing involves computing models which use the recombination behavior of DNA molecules as computation devices. This idea was successfully applied by Adleman in his biological experiment in order to show the solvability of the Hamiltonian path problem for larger instances. In 1998, a DNA based computation model, called sticker system, which is an abstraction of the computations using the recombination behavior as in Adleman’s experiment was proposed. In 2013, a new variant of sticker system using weights was introduced, namely the weighted sticker system. In this paper, the generative capacity for several variants of bounded delay and nonrestrictive weighted sticker systems are investigated. The relation between families of languages generated by several variants of weighted sticker systems and weighted grammars are also presented. Science Society of Thailand under Royal Patronage 2017 Article PeerReviewed application/pdf en http://irep.iium.edu.my/53808/1/53808_Generative%20capacity%20of%20sticker%20systems.pdf application/pdf en http://irep.iium.edu.my/53808/7/53808_Generative%20capacity%20of%20sticker%20systems_Scopus.pdf Gan, Yee Siang and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2017) Generative capacity of sticker systems with the presence of weights. Science Asia, 43S. pp. 35-42. ISSN 1513-1874 http://www.scienceasia.org/content/viewabstract.php?ms=8950&v=55&abst=1 10.2306/scienceasia1513-1874.2017.43S.035 |
| spellingShingle | QA Mathematics QA75 Electronic computers. Computer science Gan, Yee Siang Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Generative capacity of sticker systems with the presence of weights |
| title | Generative capacity of sticker systems with the presence of weights |
| title_full | Generative capacity of sticker systems with the presence of weights |
| title_fullStr | Generative capacity of sticker systems with the presence of weights |
| title_full_unstemmed | Generative capacity of sticker systems with the presence of weights |
| title_short | Generative capacity of sticker systems with the presence of weights |
| title_sort | generative capacity of sticker systems with the presence of weights |
| topic | QA Mathematics QA75 Electronic computers. Computer science |
| url | http://irep.iium.edu.my/53808/ http://irep.iium.edu.my/53808/ http://irep.iium.edu.my/53808/ http://irep.iium.edu.my/53808/1/53808_Generative%20capacity%20of%20sticker%20systems.pdf http://irep.iium.edu.my/53808/7/53808_Generative%20capacity%20of%20sticker%20systems_Scopus.pdf |