Watson-Crick online tessellation automaton and timed Watson-Crick ω-automaton

摘要

Watson-Crick finite automata are language recognizing devices similar to finite automata introduced in DNA computing area. We define Watson-Crick online tessellation automata which works on double-stranded arrays where the two strands relate to each other through a complementary relation inspired by the DNA complementarity. Some computational power of this automaton is dealt with. Also we define timed Watson-Crick ω-automaton and some equivalence results have been established.