Regular languages, regular grammars and automata in splicing systems
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...
Saved in:
Main Authors: | Mohamad Jan, Nurhidaya, Fong, Wan Heng, Sarmin, Nor Haniza |
---|---|
Format: | Conference or Workshop Item |
Published: |
2013
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/51274/ http://dx.doi.org/10.1063/1.4801217 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Automata for DNA splicing languages with palindromic and non-palindromic restriction enzymes using grammars
by: Fong, Wan Heng, et al.
Published: (2019) -
Automata for DNA splicing languages with two restriction enzymes
by: Ismail, Nurul Izzaty, et al.
Published: (2020) -
1-Normal form for static Watson-Crick regular and linear grammars
by: Abdul Rahman, Aqilahfarhana, et al.
Published: (2020) -
Closure properties of static Watson-Crick regular grammars
by: Fong, Wan Heng, et al.
Published: (2018) -
Automata diagrams for non - simple splicing system
by: Sarmin, Nor Haniza, et al.
Published: (2009)