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...
保存先:
主要な著者: | Abdul Rahman, Aqilahfarhana, Wan, Heng Fong, Sarmin, Nor Haniza, Turaev, Sherzod |
---|---|
フォーマット: | 論文 |
出版事項: |
Akademi Sains Malaysia
2020
|
主題: | |
オンライン・アクセス: | http://eprints.utm.my/id/eprint/93801/ http://dx.doi.org/10.32802/asmscj.2020.sm26(5.1) |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Static Watson-Crick context-free grammars
著者:: Fong, Wan Heng, 等
出版事項: (2019) -
Closure properties of static Watson-Crick regular grammars
著者:: Fong, Wan Heng, 等
出版事項: (2018) -
Closure properties of static Watson-Crick linear and context-free grammars
著者:: Abdul Rahman, Aqilahfarhana, 等
出版事項: (2020) -
Static Watson-Crick linear grammars and its computational power
著者:: Abdul Rahman, Aqilahfarhana, 等
出版事項: (2019) -
Static watson-crick linear grammars and its computational power
著者:: Abdul Rahman, Aqilahfarhana, 等
出版事項: (2019)