TY - JOUR AU - Fong, Wan Heng AU - Rahman, Aqilahfarhana Abdul AU - Sarmin, Nor Haniza AU - Turaev, Sherzod PY - 2019/06/27 Y2 - 2024/03/29 TI - Static Watson-Crick Context-Free Grammars JF - International Journal of Online and Biomedical Engineering (iJOE) JA - Int. J. Onl. Eng. VL - 15 IS - 10 SE - Papers DO - 10.3991/ijoe.v15i10.10878 UR - https://online-journals.org/index.php/i-joe/article/view/10878 SP - pp. 65-76 AB - 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 biological properties of DNA. Both of these models use the feature of Watson-Crick complementarity in DNA computing. Previously, the grammar counterpart of the Watson-Crick automata have been introduced, known as Watson-Crick grammars which are classified into three classes: Watson-Crick regular grammars, Watson-Crick linear grammars and Watson-Crick context-free grammars. In this research, a new variant of Watson-Crick grammar called a static Watson-Crick context-free grammar, which is a grammar counterpart of sticker systems that generates the double-stranded strings and uses rule as in context-free grammar, is introduced. The static Watson-Crick context-free grammar differs from a dynamic Watson-Crick context-free grammar in generating double-stranded strings, as well as for regular and linear grammars. The main result of the paper is to determine the generative powers of static Watson-Crick context-free grammars. Besides, the relationship of the families of languages generated by Chomsky grammars, sticker systems and Watson-Crick grammars are presented in terms of their hierarchy. ER -