Some properties of probabilistic semi-simple splicing systems
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. Over the years, various types of splicing languages have been defined and studied by different mathematicians. Splicing systems with finite se...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/27319/ http://irep.iium.edu.my/27319/ http://irep.iium.edu.my/27319/1/ISPC_2012_329-344.pdf |
| Summary: | 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. Over the years, various types of splicing languages have been defined and studied by different mathematicians. Splicing systems with finite sets of axioms only generate regular languages. Therefore, different restrictions have been considered to increase the computational power up to the recursively enumerable languages. In this research, a variant of splicing systems called probabilistic splicing systems has been used to define different types of splicing systems such as probabilistic simple splicing systems, probabilistic semi-simple splicing systems and probabilistic one-sided splicing systems. In probabilistic splicing systems, probabilities (real numbers in the range of 0 and 1) are associated with the axioms, and the probability p(z)of the string z generated from two strings x
and y is calculated from the probability p(x)and p(y) according to the operation *(multiplication) defined on the probabilities, i.e., p(z) = p(x) * p(y). |
|---|