Watson-Crick local languages and Watson-Crick two dimensional local languages

Samuel Mary Jemima, Rajkumar Dare


Watson-Crick finite automata are language recognizing devices similar to finite automata introduced in DNA computing area. Local languages are of great interest in the study of formal languages using factors of length two or more. We define Watson-Crick local languages using double stranded sequences where the two strands relate to each other through a complementary relation inspired by the DNA complementarity. We also define tiling recognizable Watson-Crick local languages and prove some closure properties. We also extend Watson-Crick local languages to finite arrays and prove some closure properties.

Full Text:



D. Beauquier and J.E. Pin, Scanners and Languages, Theoretical Computer science, 84 (1991), 3 - 21.

R. Freund, Gh. Paun, G. Rozenberg and A. Salomaa, Watson - Crick Finite automata, Proceedings of 3rd DIMACS, Workshop on DNA based computers, Philadelphia (1997), 297 - 328.

D. Giammarresi and A. Restivo, Two Dimensional Languages, Handbook of Formal Languages, Volume 3, Springer - Verlag, 1997, 215 - 257.

W. Thomas, Languages, Automata and Logic, In G. Rosenberg and A. Salomaa, editors, Handbook of Formal Language, Vol-3 (1997), 389 - 455.


  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.