DocumentCode
3227096
Title
Watson-Crick online tessellation automaton and timed Watson-Crick ω-automaton
Author
Samuel, Mary Jemima ; Daret, V.R.
Author_Institution
Dept. of Math., Anna Adarsh Coll. for Women, Chennai, India
fYear
2010
fDate
23-26 Sept. 2010
Firstpage
1322
Lastpage
1330
Abstract
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.
Keywords
finite automata; Watson-Crick finite automata; Watson-Crick online tessellation automaton; double-stranded array; timed Watson-Crick ω-automaton; Automata; Clocks; DNA; Iron; Watson-Crick online tessellation automaton; equivalence; timed Watson-Crick w-automaton;
fLanguage
English
Publisher
ieee
Conference_Titel
Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on
Conference_Location
Changsha
Print_ISBN
978-1-4244-6437-1
Type
conf
DOI
10.1109/BICTA.2010.5645070
Filename
5645070
Link To Document