Kingshuk Chatterjee

State complexity of deterministic Watson---Crick automata and time varying 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. State complexity of Watson–Crick automata has also been discussed. In this paper we analyze the state complexity of deterministic Watson–Crick automata with respect to non-deterministic block automata and non-deterministic finite automata. We also introduce new finite automata combining the properties of Watson–Crick automata and time varying automata. These automata have the unique property that the 1-limited stateless variant of these automata have the power to count. We further discuss the state complexity of time varying automata and time varying Watson–Crick automata.

Segmentation of Acute Brain Stroke from MRI of Brain Image Using Power Law Transformation with Accuracy Estimation

Segmentation of acute brain stroke and its position is very important task in medical community. Accurate segmentation of brain’s abnormal region by computer aided design (CAD) system is very difficult and challenging task due to its irregular shape, size, high degree of intensity and textural similarity between normal areas and abnormal regions areas. We developed a new method using power law transformation which gives very fine result visually and from quantifiable point of view. Our methods gives very accurate segmented tumor output with very low error rate and very high accuracy.

Reversible Watson---Crick automata

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.

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.

Watson-Crick pushdown automata

A multi-head 1-way pushdown automaton with

Multi-head Watson–Crick automata

k

A New Efficient Binarization Method for MRI of Brain Image

heads is a pushdown automaton with

Equivalence of Subclasses of Two-Way Non-Deterministic Watson Crick Automata

k

Restricted deterministic Watson-Crick automata.

1-way read heads on the input tape and a stack. It was previously shown that the deterministic variant of the model cannot accept all the context free languages. In this paper, we introduce a 2-tape, 2-head model namely Watson-Crick pushdown automata where the content of the second tape is determined using a complementarity relation, similar to Watson-Crick automata. We show computational powers of nondeterministic two-head pushdown automata and nondeterministic Watson-Crick pushdown automata are same. Moreover, deterministic Watson-Crick pushdown automata can accept all the context free languages.

Multiple Object Tracking by Scale Space Representation of Objects, Method of Linear Assignment, and Kalman Filter

ABSTRACT 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 single tape of a multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to the 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 variants 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.