Regular languages, regular grammars and automata in splicing systems

• Main Authors: Mohamad Jan, Nurhidaya, Fong, Wan Heng, Sarmin, Nor Haniza
• Format: Conference or Workshop Item
• Published: 2013
• Subjects: Q Science; QA Mathematics
• Online Access: http://eprints.utm.my/id/eprint/51274/; http://dx.doi.org/10.1063/1.4801217

Splicing system is known as a mathematical model that initiates the connection between the study of DNA molecules and formal language theory. In splicing systems, languages called splicing languages refer to the set of double-stranded DNA molecules that may arise from an initial set of DNA molecules in the presence of restriction enzymes and ligase. In this paper, some splicing languages resulted from their respective splicing systems are shown. Since all splicing languages are regular, languages which result from the splicing systems can be further investigated using grammars and automata in the field of formal language theory. The splicing language can be written in the form of regular languages generated by grammar. Besides that, splicing systems can be accepted by automata. In this research, two restriction enzymes are used in splicing systems namely BfuCI and NcoI.