Debayan Ganguly

Learn More
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(More)
  • 1