| Home  | About ScienceAsia  | Publication charge  | Advertise with us  | Subscription for printed version  | Contact us  
Editorial Board
Journal Policy
Instructions for Authors
Online submission
Author Login
Reviewer Login
Volume 45 Number 1
Volume 44 Number 6
Volume 44 Number 5
Volume 44 Number 4
Volume 44 Number 3
Volume 44 Number 2
Earlier issues
Volume 43S Number 1 Volume 43 Number 1

previous article next article 1

Research articles

ScienceAsia 43S(2017): 35-42 |doi: 10.2306/scienceasia1513-1874.2017.43S.035

Generative capacity of sticker systems with the presence of weights

Y.S. Gana,*, W.H. Fongb, N.H. Sarminb, S. Turaevc

ABSTRACT:     DNA computing involves computing models which use the recombination behaviour 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. A DNA-based computation model called a sticker system is an abstraction of the computations using the recombination behaviour as in Adleman's experiment. In this paper, the generative capacity of several variants of bounded delay and unrestricted weighted sticker systems is investigated. The relation between families of languages generated by several variants of weighted sticker systems and weighted grammars is also presented.

Download PDF

38 Downloads 13087 Views

a Xiamen University Malaysia, Jalan Sunsuria, Bandar Sunsuria, 43900 Sepang, Selangor, Malaysia
b Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 UTM Johor Bahru, Johor, Malaysia
c Department of Computer Science, Faculty of Information and Communication Technology, International Islamic University of Malaysia, 53100 Kuala Lumpur, Malaysia

* Corresponding author, E-mail: ysgan@xmu.edu.my

Received 1 Dec 2014, Accepted 1 Jun 2017