The computational power of Watson-Crick grammars: Revisited
A Watson-Crick finite automaton is one of DNA computational models using the Watson-Crick complementarity feature of deoxyribonucleic acid (DNA). We are interested in investigating a grammar counterpart of Watson-Crick automata. In this paper, we present results concerning the generative power of Wa...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
2016
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/52955/ http://irep.iium.edu.my/52955/13/52955.pdf http://irep.iium.edu.my/52955/19/52955_The%20computational%20power%20of%20Watson_SCOPUS.pdf |