Probabilistic regular sticker system and its properties

Sticker system was introduced by Kari in 1998. Sticker system is a model for DNA computing using the recombination behavior of DNA molecules based on the Watson-Crick complementary: starting from the incomplete double stranded sequences and iteratively using sticking operations until a complete doub...

Full description

Bibliographic Details
Main Authors:	Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Conference or Workshop Item
Language:	English
Published:	2014
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/36855/ http://irep.iium.edu.my/36855/ http://irep.iium.edu.my/36855/1/02_Probabilistic_Regular_Sticker_System_and_Its_Properties_ISPC_2014.pdf

id	iium-36855
recordtype	eprints
spelling	iium-368552014-06-09T01:53:16Z http://irep.iium.edu.my/36855/ Probabilistic regular sticker system and its properties Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA75 Electronic computers. Computer science Sticker system was introduced by Kari in 1998. Sticker system is a model for DNA computing using the recombination behavior of DNA molecules based on the Watson-Crick complementary: starting from the incomplete double stranded sequences and iteratively using sticking operations until a complete double stranded sequence is obtained. It is known that sticker systems with finite sets of axioms and sticker rules generate only regular languages. Hence, different types of restrictions have been considered to increase the computational power of sticker systems. Recently, a variant of restricted sticker systems, called probabilistic sticker systems, has been introduced. In this system, probabilities are initially associated with the axioms, and the probability of a generated string is computed by multiplying the probabilities of all occurrences of the initial strings in the computation of the string. Strings for the language are selected according to some probabilistic requirements. In this paper, we study the properties of probabilistic regular sticker systems. We prove that the probabilistic enhancement increases the computational power of regular sticker systems. 2014 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/36855/1/02_Probabilistic_Regular_Sticker_System_and_Its_Properties_ISPC_2014.pdf Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2014) Probabilistic regular sticker system and its properties. In: 2nd International Science Postgraduate Conference 2014 (ISPC2014), 10th-12th Mar. 2014, Ibnu Sina Institute, Universiti Teknologi Malaysia Johor Bahru, Johor. http://www.fs.utm.my/~ispc2014/
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Probabilistic regular sticker system and its properties
description	Sticker system was introduced by Kari in 1998. Sticker system is a model for DNA computing using the recombination behavior of DNA molecules based on the Watson-Crick complementary: starting from the incomplete double stranded sequences and iteratively using sticking operations until a complete double stranded sequence is obtained. It is known that sticker systems with finite sets of axioms and sticker rules generate only regular languages. Hence, different types of restrictions have been considered to increase the computational power of sticker systems. Recently, a variant of restricted sticker systems, called probabilistic sticker systems, has been introduced. In this system, probabilities are initially associated with the axioms, and the probability of a generated string is computed by multiplying the probabilities of all occurrences of the initial strings in the computation of the string. Strings for the language are selected according to some probabilistic requirements. In this paper, we study the properties of probabilistic regular sticker systems. We prove that the probabilistic enhancement increases the computational power of regular sticker systems.
format	Conference or Workshop Item
author	Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod
author_facet	Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod
author_sort	Selvarajoo, Mathuri
title	Probabilistic regular sticker system and its properties
title_short	Probabilistic regular sticker system and its properties
title_full	Probabilistic regular sticker system and its properties
title_fullStr	Probabilistic regular sticker system and its properties
title_full_unstemmed	Probabilistic regular sticker system and its properties
title_sort	probabilistic regular sticker system and its properties
publishDate	2014
url	http://irep.iium.edu.my/36855/ http://irep.iium.edu.my/36855/ http://irep.iium.edu.my/36855/1/02_Probabilistic_Regular_Sticker_System_and_Its_Properties_ISPC_2014.pdf
first_indexed	2023-09-18T20:52:51Z
last_indexed	2023-09-18T20:52:51Z
_version_	1777410110133370880

Probabilistic regular sticker system and its properties

Similar Items