Some properties of probabilistic one-sided sticker systems

Sticker systems have been introduced by Kari in 1998 as an abstract computational model which uses the Watson-Crick complementary principle of DNA molecules: starting from the incomplete double stranded sequences and iteratively using sticking operations, complete double stranded sequences are obtai...

Full description

Bibliographic Details
Main Authors:	Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Article
Language:	English
Published:	AENSI Publications 2014
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/36788/ http://irep.iium.edu.my/36788/ http://irep.iium.edu.my/36788/1/01_Some_Properties_of_Probabilistic_One-Sided_Sticker_Systems_AEB_%282014%29.pdf

id	iium-36788
recordtype	eprints
spelling	iium-367882015-07-26T16:16:52Z http://irep.iium.edu.my/36788/ Some properties of probabilistic one-sided sticker systems Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA75 Electronic computers. Computer science Sticker systems have been introduced by Kari in 1998 as an abstract computational model which uses the Watson-Crick complementary principle of DNA molecules: starting from the incomplete double stranded sequences and iteratively using sticking operations, complete double stranded sequences are 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, probabilistic sticker systems have been introduced where the 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. In this paper, some properties of probabilistic one-sided sticker systems, which are special types of probabilistic sticker systems, are investigated. We prove that probability restriction on one-sided sticker systems can increase the computational power of the languages generated. AENSI Publications 2014 Article PeerReviewed application/pdf en http://irep.iium.edu.my/36788/1/01_Some_Properties_of_Probabilistic_One-Sided_Sticker_Systems_AEB_%282014%29.pdf Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2014) Some properties of probabilistic one-sided sticker systems. Advances in Environmental Biology, 8 (3). pp. 717-724. ISSN 1995-0756 http://www.uifactor.org/JournalDetails.aspx?jid=553
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 Some properties of probabilistic one-sided sticker systems
description	Sticker systems have been introduced by Kari in 1998 as an abstract computational model which uses the Watson-Crick complementary principle of DNA molecules: starting from the incomplete double stranded sequences and iteratively using sticking operations, complete double stranded sequences are 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, probabilistic sticker systems have been introduced where the 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. In this paper, some properties of probabilistic one-sided sticker systems, which are special types of probabilistic sticker systems, are investigated. We prove that probability restriction on one-sided sticker systems can increase the computational power of the languages generated.
format	Article
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	Some properties of probabilistic one-sided sticker systems
title_short	Some properties of probabilistic one-sided sticker systems
title_full	Some properties of probabilistic one-sided sticker systems
title_fullStr	Some properties of probabilistic one-sided sticker systems
title_full_unstemmed	Some properties of probabilistic one-sided sticker systems
title_sort	some properties of probabilistic one-sided sticker systems
publisher	AENSI Publications
publishDate	2014
url	http://irep.iium.edu.my/36788/ http://irep.iium.edu.my/36788/ http://irep.iium.edu.my/36788/1/01_Some_Properties_of_Probabilistic_One-Sided_Sticker_Systems_AEB_%282014%29.pdf
first_indexed	2023-09-18T20:52:44Z
last_indexed	2023-09-18T20:52:44Z
_version_	1777410102533292032

Some properties of probabilistic one-sided sticker systems

Similar Items