arXiv subjects

Kumar Sankar Ray

Publications and source records attributed to Kumar Sankar Ray.

26 records · Page 2Linked to original sources

arXiv2016

Restricted deterministic Watson-Crick automata

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 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, unary regular, finite, context free and context sensitive. We also show that computational power of restricted deterministic Watson- Crick automata with L in regular languages is same as that of deterministic Watson-Crick automata and that the set of all languages accepted by restricted deterministic Watson-Crick automata with L in unary regular languages is a proper subset of context free languages.

cs.FL↗

arXiv2015

Watson-Crick Quantum Finite Automata

1-way quantum finite automata are deterministic and reversible in nature, which greatly reduces its accepting property. In fact the set of languages accepted by 1-way quantum finite automata is a proper subset of regular languages. In this paper we replace the tape head of 1-way quantum finite automata with DNA double strand and name the model Watson-Crick quantum finite automata. The non-injective complementarity relation of Watson-Crick automata introduces non-determinism in the quantum model. We show that this introduction of non-determinism increases the computational power of 1-way Quantum finite automata significantly. We establish that Watson-Crick quantum finite automata can accept all regular languages and that it also accepts some languages not accepted by any multihead deterministic finite automata. Exploiting the superposition property of quantum finite automata we show that Watson-Crick quantum finite automata accept the language L=ww where w belongs to {a,b}*.

cs.FL↗

arXiv2015

Reversible Watson-Crick Automata

Watson-Crick automata are finite automata working on double strands. Extensive research work has already been done on non-deterministic Watson-Crick automata and on deterministic Watson-Crick automata. In this paper, we introduce a new model of Watson-Crick automata which is reversible in nature named reversible Watson-Crick automata and explore its computational power. We show even though the model is reversible and one way it accepts all regular languages and also analyze the state complexity of the above stated model with respect to non-deterministic block automata and non-deterministic finite automata and establish its superiority. We further explore the relation of the reversible model with twin-shuffle language and recursively enumerable languages.

cs.FL↗

arXiv2015

Multi-head Watson-Crick automata

Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to Watson-Crick complementarity relation. We establish the superiority of our model over multi-head finite automata and also show that both the deterministic and non-deterministic variant of the model can accept non-regular unary languages. We also compare our model with parallel communicating Watson-Crick automata systems and prove that both of them have the same computational power.

cs.FL↗

arXiv2015

Non-regular unary language and parallel communicating Watson-Crick automata systems

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={a^(n^2 ),where n>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 can accept the same language L using just two components.

cs.FL↗

arXiv2015

Deterministic parallel communicating Watson-Crick automata systems

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 terms of their computational ability. We have also compared the computational ability of our system with multihead finite automata and parallel communicating finite automata systems.

cs.FL↗

arXiv2015

Prediction of Radiation Fog by DNA Computing

In this paper we propose a wet lab algorithm for prediction of radiation fog by DNA computing. The concept of DNA computing is essentially exploited for generating the classifier algorithm in the wet lab. The classifier is based on a new concept of similarity based fuzzy reasoning suitable for wet lab implementation. This new concept of similarity based fuzzy reasoning is different from conventional approach to fuzzy reasoning based on similarity measure and also replaces the logical aspect of classical fuzzy reasoning by DNA chemistry. Thus, we add a new dimension to existing forms of fuzzy reasoning by bringing it down to nanoscale. We exploit the concept of massive parallelism of DNA computing by designing this new classifier in the wet lab. This newly designed classifier is very much generalized in nature and apart from prediction of radiation fog this methodology can be applied to other types of data also. To achieve our goal we first fuzzify the given observed parameters in a form of synthetic DNA sequence which is called fuzzy DNA and which handles the vague concept of human reasoning.

q-bio.BM↗

arXiv2015

Logical Inference by DNA Strand Algebra

Based on the concept of DNA strand displacement and DNA strand algebra we have developed a method for logical inference which is not based on silicon based computing. Essentially, it is a paradigm shift from silicon to carbon. In this paper we have considered the inference mechanism, viz. modus ponens, to draw conclusion from any observed fact. Thus, the present approach to logical inference based on DNA strand algebra is basically an attempt to develop expert system design in the domain of DNA computing. We have illustrated our methodology with respect to worked out example. Our methodology is very flexible for implementation of different expert system applications.

q-bio.BM↗