A Watson-Crick automaton is recently introduced as a computational model of DNA computing framework. It works on tapes consisting of double stranded sequences of symbols. Symbols placed on the corresponding cells of the double-stranded sequences are related by a complimentary relation. In this paper, we investigate a variation of Watson-Crick automata in which both heads read the tape in revers...

D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...

DNA strands that, mathematically speaking, are finite strings over the alphabet {A, G, C, T} are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each other or to themselves in either intended or unintended ways. One of the structures that is usually undesirable f...

In this paper, we have introduced the deterministic variant of parallel communicating Watson-Crick automata systems. We show that similar to the non-deterministic version, the deterministic version can also recognise some non-regular uniletter languages. We further establish that strongly deterministic Watson-Crick automata systems and deterministic Watson-Crick automata system are incomparable...

In 2006, Czeizler et.al. introduced parallel communicating Watson-Crick automata system. They showed that parallel communicating Watson-Crick automata system can accept the non-regular unary language L={ , > 1} using non-injective complementarity relation and three components. In this paper, we improve on Czeizler et.al. work by showing that parallel communicating Watson-Crick automata system c...

Watson–Crick automata are finite state automata working on double-stranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper, we continue the investigation of descriptional complexity ofWatson–Crick automata initiated by Păun et al. [A. Păun, M. Păun, State and transition complexity of Watson–Crick finite automata, in: G. Ciobanu, G. Paun (Eds.), Funda...

we have evaluated the nmr shielding tensors for a:t,g:c,a:u in watson-crick, and u-quartet. we have computed nmr shielding tensors at b31yp level by using 6-31g(d) basis set. we have compute anisotropy and asymmetry in a:t,g:c,a:u and u-quartet. the nmr shielding tensors were calculated using the giao method. the natural bonding orbital analysis (nbo) were performed. nbo calculation have been ...

In this paper, we introduce a new model of deterministic Watson-Crick automaton namely restricted deterministic WatsonCrick automaton which is a deterministic Watson-Crick automaton where the complementarity string in the lower strand is restricted to a language L. We examine the computational power of the restricted model with respect to L being in different language classes such as regular, u...