Watson-Crick grammar and its label languages

DNA molecules are the building blocks of life. In the last few decades, the fields of biotechnology and molecular biology have made significant progress. Computer scientists have used the storage capacity and massive parallelism of DNA molecules in order to build computing devices and investigated the computing powers of these models and their efficiency in solving computational hard problems. In this paper, we investigate Szilard / control languages of a new type of computing model where the underlying model is based on the working of DNA molecules. DNA molecules are double-stranded and contain chains of nucleotides. These nucleotides are characterized into four types, i.e., A (adenine), T (thymine), G (guanine) and C (cytosine) based on their chemical bases. Furthermore, these nucleotides follow Watson-Crick complementary, i.e., A-T and G-C pairing. We derive the Szilard / control languages of Watson-crick (WK) grammars. Also, we compare the family of Szilard / control languages of these systems with the family of languages such as REG, CF and RE.