Probabilistic semi-simple splicing system and its characteristics

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)

PDF - Published Version Restricted to Repository staff only Download (946kB) | Request a copy

Abstract

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.

Item Type:	Article (Journal)
Additional Information:	6846/32268
Uncontrolled Keywords:	DNA computing; probabilistic splicing systems; splicing languages; regular languages
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science
Depositing User:	Dr. Sherzod Turaev
Date Deposited:	11 Oct 2013 14:32
Last Modified:	11 Oct 2013 14:32
URI:	http://irep.iium.edu.my/id/eprint/32268

Actions (login required)

View Item