Computational Power of Static Watson-Crick Context-free Grammars
PDF

Keywords

DNA computing; Watson-Crick grammar; Context-free grammar; Sticker systems; Computational power

How to Cite

Fong, W. H., Abdul Rahman, A., Sarmin, N., & Turaev, S. (2019). Computational Power of Static Watson-Crick Context-free Grammars. Science Proceedings Series, 1(2), 82-85. https://doi.org/10.31580/sps.v1i2.679

Abstract

Sticker system is a computer model which is coded with single and double-stranded molecules of DNA; meanwhile, Watson-Crick automata is the automata counterpart of the sticker system representing the biological properties of DNA. Both are the modelings of DNA molecules in DNA computing which use the feature of Watson-Crick complementarity. Formerly, Watson-Crick grammars which are classified into three classes have been introduced [1]. In this research, a grammar counterpart of sticker systems that uses the rule as in context-free grammar is introduced, known as a static Watson-Crick context-free grammar. The research finding on the computational power of these grammar shows that the family of context-free languages is strictly included in the family of static Watson-Crick context-free languages; the          static Watson-Crick context-free grammars can generate non context-free languages; the family of Watson-Crick context-free languages is included in the family of static Watson-Crick context-free languages which are presented in terms of their hierarchy.

https://doi.org/10.31580/sps.v1i2.679
PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.