On Watson-Crick automata

Authors:
K. G. Subramanian;S. Hemalatha;Ibrahim Venkat
Affiliations:
Universiti Sains Malaysia, Penang, Malaysia;S.D.N.B. Vaishnav College, Chennai, India;Universiti Sains Malaysia, Penang, Malaysia
Venue:
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Year:
2012

Citing 9
Cited 0

Complexity and decidability for chain code picture languages

Theoretical Computer Science
Formal languages

Formal languages
Complexity and decidability for restricted classes of picture languages

Theoretical Computer Science
Decision problems and regular chain code picture languages

Discrete Applied Mathematics
Picture languages—a survey

Languages of Design
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
From DNA Recombination to DNA Computing, Via Formal Languages

Selected papers from the German Conference on Bioinformatics
The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages

IEICE - Transactions on Information and Systems
Context-Free Systems with a Complementarity Relation

BIC-TA '11 Proceedings of the 2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.