Deterministic synchronous systems consisting of two finite automata running in opposite
directions on a shared read-only input are studied with respect to their ability to perform …

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 …

One-way quantum finite automata are reversible in nature, which greatly reduces its
accepting property. In fact, the set of languages accepted by one-way quantum finite …

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 …

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 work, we analyze the computational power of Watson-Crick finite automata (WKFA) if
some restrictions over the transition function in the model are imposed. We consider that the …

Reversible Watson-Crick automata introduced by Chatterjee et. al. is a reversible variant of
an Watson-Crick automata. It has already been shown that the addition of DNA properties to …

Inspired by multi-head finite automata and Watson–Crick automata, in this paper, we
introduce a new structure, namely multi-head Watson–Crick automata, where we replace the …