References
- Giammarresi , D. and Restivo , A. 1996 . Two-dimensional finite state recognizability . Fundamenta Informaticae , 25 : 399 – 422 .
- Prophetis , L. D. and Varricchio , S. 1997 . Recognizability of rectangular picture languages by Wang systems . Journal of Automata, Languages and Combinatorics , 2 : 269 – 288 .
- Siromoney , G. , Siromoney , R. and Krithivasan , K. 1972 . Abstract families of matrices and picture languages . Computer Graphics and Image Processing , 1 : 284 – 307 .
- Siromoney , G. , Siromoney , R. and Krithivasan , K. 1973 . Picture languages with array rewriting rules . Information and Control , 22 : 447 – 470 .
- Patch , K. 2002 . DNA solves big problem . Available online at: http://www.trnmag.com/Stories/2002/032002/DNA_solves_big_problem_032002.html, last accessed September 2004
- Kari , L. 1997 . DNA computing: arrival of biological mathematics . Mathematical Intelligencer , 19 : 9 – 22 .
- Freifelder , D. 2000 . Molecular Biology , (2nd edn) , New Delhi : Narosa .
- Lewin , B. 2000 . Genes VII , New York : Oxford University Press .
- Paun , G. , Rozenberg , G. and Salomaa , A. 1998 . DNA Computing: New Computing Paradigms , Berl : Springer-Verlag .
- Murugan , A. and Easwarakumar , K. S. 2004 . Transposition based contextual insertion on linear DNA strands with deletion precedence . International Journal of Computer Mathematics , 81 : 647 – 660 .
- Easwarakumar , K. S. , Murugan , A. and Possibilities of constructing two dimensional picture in DNA computing. International Journal of Computer Mathematics , Part I. To appear in
- Krithivasan , K. , Balan , M. S. and Rama , R. 2000 . “ Array contextual grammars ” . In Recent Topics in Mathematical and Computational Linguistics , Edited by: Martin-Vide , C. and Paun , G. H. 154 – 168 . Sofra : Pensoft .
- Giammarresi , D. and Restivo , A. 1997 . “ Two-dimensional languages ” . In Handbook of Formal Languages , Edited by: Salomaa , A. and Rozenberg , G. Vol. 3 , 215 – 267 . Berl : Springer-Verlag . Beyond Words
- Rothemund , P. and Winfree , E. The program-size complexity of self-assembled squares (extended abstract) . Proceedings of the 32nd Annual ACM Symposium on Theory of Computing . pp. 459 – 468 . New York : ACM Press .
- Wang , H. 1961 . Proving theorems by pattern recognition II . Bell Systems Technical Journal , 40 : 1 – 42 .
- Reif , J. H. 1999 . Local parallel biomolecular computation . Discrete Mathematics and Theoretical Computer Science , 48 : 217 – 254 .
- Culik , C. II and Kari , J. 1996 . An aperiodic set of Wang cubes . Lecturer Notes in Computer Science , 1046 : 137 – 147 .
- Latteux , D. and Simplot , D. 1997 . Recognizable picture languages and domino tiling . Theoretical Computer Science , 178 : 275 – 283 .