Some characteristics of probabilistic one-sided splicing systems

• Main Authors: Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
• Format: Conference or Workshop Item
• Language: English
• Published: 2013
• Subjects: QA Mathematics; QA75 Electronic computers. Computer science
• Online Access: http://irep.iium.edu.my/32264/1/50517-SKSM20_18-20_Dec_2012_AIP_Proceedings_1522_%28Mathuri%29_967-975.pdf; http://irep.iium.edu.my/32264/; http://proceedings.aip.org/resource/2/apcpcs/1522/1/967_1?isAuthorized=no
• Institution: Universiti Islam Antarabangsa Malaysia

A theoretical model for DNA computing using the recombination behavior of DNA molecules known as a splicing system has been introduced in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings at the specific places and attaches the prefix of the first string to the suffix of the second string and the prefix of the second string to the suffix of the first string yielding the new strings. It is known that splicing systems with finite sets of axioms and splicing rules only generate regular languages. Hence, different types of restrictions for splicing systems have been considered to increase the computational power of the languages generated. Recently, probabilistic splicing systems have been introduced where the probabilities are initially associated with the axioms, and the probabilities of the generated strings are computed from the probabilities of the initial strings. In this paper, some properties of probabilistic one-sided splicing systems, which are special types of probabilistic splicing systems, are investigated. We prove that probabilistic one-sided splicing systems can also increase the computational power of the languages generated.