TY - GEN

T1 - Some characteristics of probabilistic one-sided splicing systems

AU - Selvarajoo, Mathuri

AU - Fong, Wan Heng

AU - Sarmin, Nor Haniza

AU - Turaev, Sherzod

PY - 2013

Y1 - 2013

N2 - A theoretical model for DNA computing using the recombination behavior of DNA molecules known as asplicing 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.

AB - A theoretical model for DNA computing using the recombination behavior of DNA molecules known as asplicing 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.

KW - Computational power

KW - DNA computing

KW - One-sided splicing systems

KW - Probabilistic splicing systems

KW - Regular languages

UR - http://www.scopus.com/inward/record.url?scp=84876903908&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876903908&partnerID=8YFLogxK

U2 - 10.1063/1.4801235

DO - 10.1063/1.4801235

M3 - Conference contribution

AN - SCOPUS:84876903908

SN - 9780735411500

T3 - AIP Conference Proceedings

SP - 967

EP - 975

BT - Proceedings of the 20th National Symposium on Mathematical Sciences, SKSM 2012 - Research in Mathematical Sciences

T2 - 20th National Symposium on Mathematical Sciences - Research in Mathematical Sciences: A Catalyst for Creativity and Innovation, SKSM 2012

Y2 - 18 December 2012 through 20 December 2012

ER -