Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that is, on a DNA
molecule. Therefore, they have two reading heads, one for each strand. In traditional WK …

Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that is, on a DNA
molecule. A double stranded DNA molecule contains two strands, each having a 5'and a …

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 …

Since 1970, reversible finite automata have generated interest among researcher; but till
now, we have not come across a model of reversible read only one-way finite automata …

A multi-head 1-way pushdown automaton with $ k $ heads is a pushdown automaton with $
k $1-way read heads on the input tape and a stack. It was previously shown that the …

Unary Watson-Crick automata - ScienceDirect Skip to main contentSkip to article Elsevier logo
Journals & Books Search RegisterSign in View PDF Download full issue Search ScienceDirect …

A new model of computation called Watson–Crick jumping finite automata was introduced
by Mahalingam et al., and the authors study the computing power and closure properties of …

In this paper, we compare the computational power of two-way Watson–Crick automata and
two-way Quantum finite automata. The language L=\left {\left. xx\right| x ∈\left {a …

In 2006, Czeizler et al. introduced parallel communicating Watson–Crick automata system.
They showed that parallel communicating Watson–Crick automata system can accept the …

In this paper, we introduce a new model of deterministic Watson-Crick automaton namely
restricted deterministic Watson-Crick automaton which is a deterministic Watson-Crick …