Probabilistic semi-simple splicing system and its characteristics

The concept of splicing system was first introduced by Head in 1987. This model has been introduced to investigate the recombinant behavior of DNA molecules. Splicing systems with finite sets of axioms only generate regular languages. Hence, different restrictions have been considered to increase th...

Full description

Bibliographic Details
Main Authors:	Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format:	Article
Language:	English
Published:	Universiti Teknologi Malaysia 2013
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/32268/ http://irep.iium.edu.my/32268/ http://irep.iium.edu.my/32268/ http://irep.iium.edu.my/32268/1/50514-Jurnal_Teknologi_2013_-_Mathuri_pg_21-26_1884-3929-1-SM.pdf

id	iium-32268
recordtype	eprints
spelling	iium-322682013-10-11T06:32:18Z http://irep.iium.edu.my/32268/ Probabilistic semi-simple splicing system and its characteristics Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod QA Mathematics QA75 Electronic computers. Computer science The concept of splicing system was first introduced by Head in 1987. This model has been introduced to investigate the recombinant behavior of DNA molecules. Splicing systems with finite sets of axioms only generate regular languages. Hence, different restrictions have been considered to increase the computational power up to the recursively enumerable languages. Recently, probabilistic splicing systems have been introduced where 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 semi-simple splicing systems, which are special types of probabilistic splicing systems, are investigated. We prove that probabilistic semi-simple splicing systems can also increase the generative power of the generated languages. Universiti Teknologi Malaysia 2013 Article PeerReviewed application/pdf en http://irep.iium.edu.my/32268/1/50514-Jurnal_Teknologi_2013_-_Mathuri_pg_21-26_1884-3929-1-SM.pdf Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Probabilistic semi-simple splicing system and its characteristics. Jurnal Teknologi, 62 (3). pp. 21-26. ISSN 2180–3722 (O), 0127–9696 (P) http://www.jurnalteknologi.utm.my/index.php/jurnalteknologi/article/view/1884 10.11113/jt.v62.1884
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 Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Probabilistic semi-simple splicing system and its characteristics
description	The concept of splicing system was first introduced by Head in 1987. This model has been introduced to investigate the recombinant behavior of DNA molecules. Splicing systems with finite sets of axioms only generate regular languages. Hence, different restrictions have been considered to increase the computational power up to the recursively enumerable languages. Recently, probabilistic splicing systems have been introduced where 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 semi-simple splicing systems, which are special types of probabilistic splicing systems, are investigated. We prove that probabilistic semi-simple splicing systems can also increase the generative power of the generated languages.
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	Probabilistic semi-simple splicing system and its characteristics
title_short	Probabilistic semi-simple splicing system and its characteristics
title_full	Probabilistic semi-simple splicing system and its characteristics
title_fullStr	Probabilistic semi-simple splicing system and its characteristics
title_full_unstemmed	Probabilistic semi-simple splicing system and its characteristics
title_sort	probabilistic semi-simple splicing system and its characteristics
publisher	Universiti Teknologi Malaysia
publishDate	2013
url	http://irep.iium.edu.my/32268/ http://irep.iium.edu.my/32268/ http://irep.iium.edu.my/32268/ http://irep.iium.edu.my/32268/1/50514-Jurnal_Teknologi_2013_-_Mathuri_pg_21-26_1884-3929-1-SM.pdf
first_indexed	2023-09-18T20:46:34Z
last_indexed	2023-09-18T20:46:34Z
_version_	1777409715003719680

Probabilistic semi-simple splicing system and its characteristics

Similar Items