Equivalence of Subclasses of Two-Way Non-Deterministic 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. Parallel Communicating Watson Crick automata systems have been introduced by E. Czeziler et al. In this paper we discuss about a variant of Watson Crick automata known as the two-way Watson Crick automata which are more powerful than non-deterministic Watson Crick automata. We also establish the equivalence of different subclasses of two-way Watson crick automata. We further show that recursively enumerable (RE) languages can be realized by an image of generalized sequential machine (gsm) mapping of two-way Watson-Crick automata.

1-Way Multihead Quantum Finite State Automata

1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-way quantum finite state automata (1QFA) and k-letter quantum finite state automata (k-letter QFA) respectively. It has been shown by Moore and Crutchfield as well as Konadacs and Watrous that 1QFA can’t accept all regular language. In this paper, we show different language recognizing capabilities of our model 1-way multihead QFAs. New results presented in this paper are the following ones: 1) We show that newly introduced 1-way 2-head quantum finite state automaton (1QFA(2)) structure can accept all unary regular languages. 2) A language which can’t be accepted by 1-way deterministic 2-head finite state automaton (1DFA((2)) can be accepted by 1QFA(2) with bounded error. 3) 1QFA(2) is more powerful than 1-way reversible 2-head finite state automaton (1RMFA(2)) with respect to recognition of language.

Pattern classification using fuzzy relation and genetic algorithm

Purpose–This paper aims to consider a soft computing approach to pattern classification using the basic tools of fuzzy relational calculus(FRC)and genetic algorithm(GA).Design/methodology/approach–The paper introduces a new interpretation of multidimensional fuzzy implication(MFI)to represent the author’s knowledge about the training data set.It also considers the notion of a fuzzy pattern vector(FPV)to handle the fuzzy information granules of the quantized pattern space and to represent a population of training patterns in the quantized pattern space.The construction of the pattern classifier is essentially based on the estimate of a fuzzy relation Ri between the antecedent clause and consequent clause of each one-dimensional fuzzy implication.For the estimation of Ri floating point representation of GA is used.Thus,a set of fuzzy relations is formed from the new interpretation of MFI.This set of fuzzy relations is termed as the core of the pattern classifier.Once the classifier is constructed the non-fuzzy features of a test pattern can be classified.Findings–The performance of the proposed scheme is tested on synthetic data.Subsequently,the paper uses the proposed scheme for the vowel classification problem of an Indian language.In all these case studies the recognition score of the proposed method is very good.Finally,a benchmark of performance is established by considering Multilayer Perceptron(MLP),Support Vector Machine(SVM)and the proposed method.The Abalone,Hosse colic and Pima Indians data sets,obtained from UCL database repository are used for the said benchmark study.The benchmark study also establishes the superiority of the proposed method.Originality/value–This new soft computing approach to pattern classification is based on a new interpretation of MFI and a novel notion of FPV.A set of fuzzy relations which is the core of the pattern classifier,is estimated using floating point GA and very effective classification of patterns under vague and imprecise environment is performed.This new approach to pattern classification avoids the curse of high dimensionality of feature vector.It can provide multiple classifications under overlapped classes.

Splicing operation and fuzzy molecular automaton

Purpose–The purpose of this study is to develop a Turing machine or a finite automaton,which scans the input data tape in the form of DNA sequences and inspires the basic design of a DNA computer.Design/methodology/approach–This model based on a splicing system can solve fuzzy reasoning autonomously by using DNA sequences and human assisted protocols.Its hardware consists of class IIS restriction enzyme and T4 DNA ligase while the software consists of double stranded DNA sequences and transition molecules which are capable of encoding fuzzy rules.Upon mixing solutions containing these components,the automaton undergoes a cascade of cleaving and splicing cycles to produce the computational result in form of double stranded DNA sequence representing automaton’s final state.Findings–In this work,the authors have fused the idea of a splicing system with the automata theory to develop fuzzy molecular automaton in which 1,018 processors can work in parallel,requiring a trillion times less space for information storage,is 105 times faster than the existing super computer and 1,019 power operations can be performed using one Joule of energy.Originality/value–This paper presents a generalized model for biologically inspired computation in nano scale.