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
PDF
- Published Version
Restricted to Registered users only Download (153kB) | Request a copy |
|
PDF (SCOPUS)
- Supplemental Material
Restricted to Registered users only Download (356kB) | Request a copy |
Abstract
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.
Item Type: | Article (Journal) |
---|---|
Additional Information: | 6846/53808 |
Uncontrolled Keywords: | DNA computing, sticker system, weight, generative capacity, formal language |
Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button): | Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science |
Depositing User: | Dr. Sherzod Turaev |
Date Deposited: | 04 Jan 2017 10:22 |
Last Modified: | 15 Jun 2021 15:36 |
URI: | http://irep.iium.edu.my/id/eprint/53808 |
Actions (login required)
View Item |