The characteristics of simple splicing languages over permutation groups

• Main Authors: Selvarajoo, M., Fong, W. H., Sarmin, N. H., Turaev, S.
• Format: Conference or Workshop Item
• Published: 2020
• Subjects: QA Mathematics
• Online Access: http://eprints.utm.my/id/eprint/93100/; http://dx.doi.org/10.1063/5.0018731

Head in 1987 was the first person to introduce the concept of splicing system as a theoretical model for DNA based computation using splicing operation. Splicing operation is a method of cutting and recombining DNA molecules under the influence of restriction enzymes such as ligase. Previous researches have proven that splicing systems with finite sets of axioms and rules generate only regular languages. Hence, in order to increase the computational power of the languages generated by splicing systems, several restrictions in the use of rules have been considered. In this paper, simple splicing systems controlled by permutation groups are defined and the computational power of the languages generated by this variable is explored.