Reversible Watson---Crick automata
Kingshuk Chatterjee,Kumar S. Ray +1 more
TLDR
A new model of one-way reversible finite automata inspired by the Watson–Crick complementarity relation is introduced and it is shown that the model can accept all regular languages.Abstract:
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 which accept all regular languages, In this paper, we introduce a new model of one-way reversible finite automata inspired by the Watson---Crick complementarity relation and show that our model can accept all regular languages. We further show that our model accepts a language which is not accepted by any multi-head deterministic finite automaton.read more
Citations
More filters
Journal ArticleDOI
Watson–Crick quantum finite automata
TL;DR: The non-injective complementarity relation of Watson–Crick automata introduces non-determinism in the quantum model and it is shown that this introduction of non-Determinism increases the computational power of one-way quantum finite automata significantly.
Posted Content
Watson-Crick Quantum Finite Automata
Kingshuk Chatterjee,Kumar S. Ray +1 more
TL;DR: In this paper, the model Watson-Crick quantum finite automata (WCFI) is introduced and the non-injective complementarity relation of WCI introduces non-determinism in the quantum model.
Journal ArticleDOI
Watson–Crick Jumping Finite Automata: Combination, Comparison and Closure
TL;DR: A restricted version of the Watson–Crick jumping finite automata model is introduced that is a combination of variants of the existing model, and the closure properties of such restricted automata are explored.
Proceedings ArticleDOI
Watson-Crick grammar and its label languages
TL;DR: In this article , the Szilard control languages of a new type of computing model where the underlying model is based on the working of DNA molecules are investigated and compared with the family of control languages such as REG, CF and RE.
Posted Content
State Complexity of Reversible Watson-Crick Automata.
TL;DR: It is shown that Reversible Watson-Crick automata in spite of being reversible in nature enjoy state complexity advantage over non deterministic finite automata.
References
More filters
Journal ArticleDOI
Logical reversibility of computation
TL;DR: This result makes plausible the existence of thermodynamically reversible computers which could perform useful computations at useful speed while dissipating considerably less than kT of energy per logical step.
Book
DNA Computing: New Computing Paradigms
TL;DR: This book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory, and brings the reader to the most advanced theories develop thus far in this emerging research area.
Proceedings ArticleDOI
On the power of quantum finite state automata
A. Kondacs,John Watrous +1 more
TL;DR: It is proved that the class of languages recognizing by linear time, bounded error 2qfa's properly includes the regular languages, and 1-way and 2-way quantum finite state automata are introduced, which are the quantum analogues of deterministic, nondeterministic and probabilistic 1- way and2-way finite state Automata.
Journal ArticleDOI
The state complexities of some basic operations on regular languages
TL;DR: It is shown that the number of states that is sufficient and necessary in the worst case for a deterministic finite automaton (DFA) to accept the catenation of an m-state DFA language and an n-stateDFA language is exactly m2n − 2n − 1, for m, n ⩾ 1.