On Watson-Crick automata

Motivated by Watson-Crick automata, we introduce here a grammar counterpart called a Watson-Crick regular grammar that has rules as in a regular grammar but involves double stranded strings. The language generated by this grammar consists of strings in the upper strands of the double stranded strings related by a complementarity relation. We obtain some properties of these grammars and also indicate an application to generation of chain code pictures.

[1]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[2]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[3]  榊原 康文,et al.  G. Paun, G. Rozenberg and A. Salomaa : "DNA Computing-New Computing Paradigms", Springer-Verlag (1998) , 2000 .

[4]  Changwook Kim.  Complexity and Decidability for Restricted Classes of Picture Languages , 1990, Theor. Comput. Sci..

[5]  Ivan Hal Sudborough,et al.  Complexity and Decidability for Chain Code Picture Languages , 1985, Theor. Comput. Sci..

[6]  Sadaki Hirose,et al.  The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages , 2006, IEICE Trans. Inf. Syst..

[7]  Derick Wood,et al.  Pure Grammars , 1980, Inf. Control..

[8]  Eugen Czeizler,et al.  A Short Survey on Watson-Crick Automata , 2006, Bull. EATCS.

[9]  Azriel Rosenfeld,et al.  Picture languages—a survey , 1993 .

[10]  Grzegorz Rozenberg,et al.  Using String Languages to Describe Picture Languages , 1982, Inf. Control..

[11]  Peter C. Chapin.  Formal languages I , 1973, CSC '73.

[12]  Rudolf Freund,et al.  Watson-Crick finite automata , 1997, DNA Based Computers.

[13]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[14]  K. G. Subramanian,et al.  Context-Free Systems with a Complementarity Relation , 2011, 2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications.

[15]  Gheorghe Paun,et al.  From DNA Recombination to DNA Computing, Via Formal Languages , 1996, German Conference on Bioinformatics.

[16]  Jürgen Dassow,et al.  Decision Problems and Regular Chain Code Picture Languages , 1993, Discret. Appl. Math..