1-Normal form for static Watson-Crick regular and linear grammars
In DNA computing, there are various formal language theoretical approaches that involves the recombinant behavior of DNA sequences. A Watson-Crick automaton is a mathematical model that represents the biological properties of DNA based on the Watson-Crick complementarity of DNA molecules. Meanw...
Saved in:
Main Authors: | Abdul Rahman, Aqilahfarhana, Wan, Heng Fong, Sarmin, Nor Haniza, Turaev, Sherzod |
---|---|
Format: | Article |
Published: |
Akademi Sains Malaysia
2020
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/93801/ http://dx.doi.org/10.32802/asmscj.2020.sm26(5.1) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Static Watson-Crick context-free grammars
by: Fong, Wan Heng, et al.
Published: (2019) -
Closure properties of static Watson-Crick regular grammars
by: Fong, Wan Heng, et al.
Published: (2018) -
Closure properties of static Watson-Crick linear and context-free grammars
by: Abdul Rahman, Aqilahfarhana, et al.
Published: (2020) -
Static Watson-Crick linear grammars and its computational power
by: Abdul Rahman, Aqilahfarhana, et al.
Published: (2019) -
Static watson-crick linear grammars and its computational power
by: Abdul Rahman, Aqilahfarhana, et al.
Published: (2019)