An Intuitive Study on the Variants of Watson Crick Automata Using Rough Sets

The Main aim of this research article is to study Watson Crick Automaton and Watson Crick Online Tessellation Automaton through Rough Transition Map. Rough set theory got introduced in Automata theory to find Rough Finite State Automaton. The idea of incorporating Rough sets with Watson Crick Automaton was done thereby introducing Watson Crick Rough Automaton. Here in this research paper, some of the properties of Watson Crick Rough Automaton are studied. The concept of Watson Crick Rough Online Tessellation Automaton is introduced and its corresponding Rough languages are discussed. Finally the Computational powers of the above variants of Watson crick Automata under Boolean operations are analyzed.