In this paper, we define Watson-Crick context-free grammars, as an extension of Watson-
Crick regular grammars and Watson-Crick linear grammars with context-free grammar rules …

Bio-inspired computing is a field of study that abstracts computing ideas (data structures,
operations with data, ways to control operations, computing models, etc.) from living …

Traditional Fuzzy Automata are not sufficient to model complex real life applications such as
biomedical systems where the inputs can be in terms of Fuzzy. Watson Crick Finite …

We define WK linear grammars, as an extension of WK regular grammars with linear
grammar rules, and WK context-free grammars, thus investigating their computational power …

In this paper, we define Watson-Crick linear grammars extending Watson-Crick regular
grammars Subramanian et al.(CCSEIT'12 proceedings of the second international …

Abstract A Watson–Crick (WK) context-free grammar, a context-free grammar with
productions whose right-hand sides contain nonterminals and double-stranded terminal …

Deoxyribonucleic acid, or popularly known as DNA, continues to inspire many theoretical
computing models, such as sticker systems and Watson-Crick grammars. Sticker systems …

This work focuses on Watson-Crick languages inspired by DNA computing, their models and
algorithms of deciding the language membership. It analyzes a recently introduced …

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 …

In formal language theory, a grammar is a set of production rules that describes the possible
strings in a given language. Context-free grammars, the most applicable type of the …