Static Watson-Crick Context-Free Grammars
Sticker systems and Watson-Crick automata are two modellings of DNA molecules in DNA computing. A sticker system is a computational model which is coded with single and double-stranded DNA molecules; while Watson-Crick automata is the automata counterpart of sticker system which represents the biolo...
Main Authors: | Wan Heng Fong, Aqilahfarhana Abdul Rahman, Nor Haniza Sarmin, Sherzod Turaev |
---|---|
Format: | Article |
Language: | English |
Published: |
International Association of Online Engineering (IAOE)
2019-06-01
|
Series: | International Journal of Online and Biomedical Engineering |
Online Access: | https://online-journals.org/index.php/i-joe/article/view/10878 |
Similar Items
-
Static Watson-Crick context-free grammars
by: Fong, Wan Heng, et al.
Published: (2019) -
Languages of Watson-Crick Petri net
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014) -
Generative Power and Closure Properties of Watson-Crick Grammars
by: Nurul Liyana Mohamad Zulkufli, et al.
Published: (2016-01-01) -
State machine of place-labelled Petri net controlled grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2017) -
The multiple personalities of Watson and Crick strands
by: Graur Dan, et al.
Published: (2011-02-01)