On bonded sequential and parallel deletion systems

Abstract

The field of DNA computing has broadened the perspective of scientists since its inception. An area of interest in this field involves the combination of theoretical computer science and molecular biology. By using the concepts of string generation and molecular structure of DNA, formal language theory can be used to model the behavior of DNA molecules, known as DNA computation models. Some computation models utilize the operation of deletion, which was introduced to generalize the operation of quotient in formal language theory, where the deletion of a word can be done either sequentially or parallelly. For sequential deletion, a word is removed at only one place in one step, whereas for parallel deletion, a word is removed everywhere simultaneously in one step. In this paper, the concept of bonded sequential and parallel deletion systems is presented along with their generative power and closure properties. Furthermore, the closure properties of some families under the bonded deletion systems are shown.