Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1145/2393216.2393242 | CCSEIT |
Keywords | Field | DocType |
watson-crick automaton,chain code picture,grammar counterpart,watson-crick regular grammar,regular grammar,upper strand,complementarity relation,finite automaton,dna computing,formal language | Context-sensitive grammar,Tree-adjoining grammar,Discrete mathematics,Context-free grammar,Regular tree grammar,Computer science,Arithmetic,Affix grammar,Formal grammar,Regular grammar,Mildly context-sensitive grammar formalism,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. G. Subramanian | 1 | 339 | 59.27 |
| S. Hemalatha | 2 | 16 | 2.87 |
| Ibrahim Venkat | 3 | 70 | 14.37 |