An algebraic approach on Watson crick rough automata

In this Research paper, the ideas of Rough Automaton and Watson Crick Automaton are combined thereby introducing Watson Crick Rough Automaton. The Rough Transition Map extension of Watson Crick Rough Automaton is done and its corresponding Rough languages are discussed. The closure properties of Languages accepted by Watson Crick Rough Automata under various operations are investigated. The Equivalence Theorem on Watson Crick Rough Automata is established. Further, few Algebraic characterizations of Watson Crick Rough Finite Automata are analysed. Finally, Homomorphism is defined and discussed on Watson Crick Rough Finite Automata and the concept of Watson Crick Rough Transformation Semi-group is dealt briefly.