Mohamad Jan, Nurhidaya and Fong, Wan Heng and Sarmin, Nor Haniza (2013) Regular languages, regular grammars and automata in splicing systems. In: Proceedings Of The 20th National Symposium On Mathematical Sciences (SKSM20): Research In Mathematical Sciences: A Catalyst For Creativity And Innovation, PTS A And B, 18 December 2012 through 20 December 2012, Putrajaya; Malaysia.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1063/1.4801217
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | automata, regular languages, regular grammars, splicing systems |
| Subjects: | Q Science Q Science > QA Mathematics |
| Divisions: | Science |
| ID Code: | 51274 |
| Deposited By: | Haliza Zainal |
| Deposited On: | 27 Jan 2016 01:53 |
| Last Modified: | 12 Sep 2017 07:09 |
Repository Staff Only: item control page
