Probabilistic semi-simple splicing system and its characteristics

• 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/1/50514-Jurnal_Teknologi_2013_-_Mathuri_pg_21-26_1884-3929-1-SM.pdf; http://irep.iium.edu.my/32268/; http://www.jurnalteknologi.utm.my/index.php/jurnalteknologi/article/view/1884
• Institution: Universiti Islam Antarabangsa Malaysia

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.