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...

Full description

Bibliographic Details
Main Authors:	Gan, Yee Siang, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Article
Language:	English
Published:	Science and Knowledge Research Society 2017
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	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

id	iium-53808
recordtype	eprints
spelling	iium-538082018-01-12T12:35:47Z 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 and Knowledge Research Society 2017 Article PeerReviewed application/pdf en http://irep.iium.edu.my/53808/1/53808_Generative%20capacity%20of%20sticker%20systems.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-1878 http://www.scienceasia.org/content/viewabstract.php?ms=8950&v=55&abst=1 10.2306/scienceasia1513-1874.2017.43S.035
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English
topic	QA Mathematics QA75 Electronic computers. Computer science
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
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.
format	Article
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
title	Generative capacity of sticker systems with the presence of weights
title_short	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_sort	generative capacity of sticker systems with the presence of weights
publisher	Science and Knowledge Research Society
publishDate	2017
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
first_indexed	2023-09-18T21:16:07Z
last_indexed	2023-09-18T21:16:07Z
_version_	1777411573472559104

Generative capacity of sticker systems with the presence of weights

Similar Items