Closure properties of Watson-Crick grammars

Abstract

In this paper, we define Watson-Crick context-free grammars, as an extension of Watson-Crick regular grammars and

Static Watson-Crick Linear Grammars and Its Computational Power

“…The inclusion for LIN and WKLIN has already been proved in Theorem 13 [9] where LIN ⊂ WKLIN. By combining the above results with the results from [8,11], we obtain the following relation. The relation in Figure 1…”

“…Historically, some grammar models that were introduced did not use the fundamental feature of Watson-Crick (WK) complementarity of DNA molecules [5][6][7]. Then, a broad variety of dynamic WK grammars that use this fundamental feature have been proposed [8][9][10]. Although these grammars use different restrictions of production rules, they still have some weaknesses when generating double-stranded strings.…”

Computational Power of Static Watson-Crick Context-free Grammars

“…In 2012, the usage of Watson-Crick complementarity of DNA molecules has been implemented in Watson-Crick regular grammars [6]. Following that, the research has been extensively studied with Watson-Crick grammars introduced in [1] but this model produces every stranded string independently and a complete double-stranded string can only be checked at the end of the computation. Therefore, this research aims to introduce a new variant of Watson-Crick grammars known as static Watson-Crick context-free grammars where the concept of Watson-Crick grammars and sticker system are implemented; and to analyse their computational powers which are shown in terms of the hierarchy.…”

“…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.…”

Watson–Crick Context-Free Grammars: Grammar Simplifications and a Parsing Algorithm

“…A pioneering work [8], which uses this fundamental feature, proposes an analytic counterpart of WK finite automata called (static) WK regular grammars, which are regular grammars with double-stranded terminal substrings on the right-hand side of productions, and generate the languages of complete double-stranded strings. Papers [9][10][11] introduce dynamic variants of WK (regular, linear and context-free) grammars, study their generative capacities and closure properties. SECTION A: COMPUTER SCIENCE THEORY, METHODS AND TOOLS THE COMPUTER JOURNAL, 2018…”