TY - JOUR AU - Abdul Rahman, Aqilahfarhana AU - Heng, Fong Wan AU - Sarmin, Nor Haniza AU - Turaev, Sherzod AU - Mohamad Zulkufli, Nurul Liyana PY - 2019/12/01 Y2 - 2024/03/28 TI - Static Watson-Crick Linear Grammars and Its Computational Power JF - MATEMATIKA JA - MATEMATIKA VL - 35 IS - 3 SE - Articles DO - 10.11113/matematika.v35.n3.1110 UR - https://matematika.utm.my/index.php/matematika/article/view/283-296 SP - AB - DNA computing, or more generally, molecular computing, is a recent development on computations using biological molecules, instead of the traditional silicon-chips. Some computational models which are based on different operations of DNA molecules have been developed by using the concept of formal language theory. The operations of DNA molecules inspire various types of formal language tools which include sticker systems, grammars and automata. Recently, the grammar counterparts of Watson-Crick automata known as Watson-Crick grammars which consist of regular, linear and context-free grammars, are defined as grammar models that generate double-stranded strings using the important feature of Watson-Crick complementarity rule. In this research, a new variant of static Watson-Crick linear grammar is introduced as an extension of static Watson-Crick regular grammar. A static Watson-Crick linear grammar is a grammar counterpart of sticker system that generates the double-stranded strings and uses rule as in linear grammar. The main result of the paper is to determine some computational properties of static Watson-Crick linear grammars. Next, the hierarchy between static Watson-Crick languages, Watson-Crick languages, Chomsky languages and families of languages generated by sticker systems are presented. ER -