Name
Abstract | ||
|---|---|---|
Motivated by the studies on Watson-Crick finite automata and Watson-Crick L systems, we introduce a generative device known as a Watson-Crick context-free system (WKCFS) making use of a complementarity relation and a context-free type of rewriting on double-stranded strings with the symbols in the string in the lower strand complementary to the symbols of the string in the upper strand. The language generated by a WKCFS is the set of all strings in the upper strands of the double-stranded strings (u, v) generated such that the strings u, v are of the same length and the corresponding symbols in the strings u, v are related by the complementarity relation. We compare the generative power of WKCFS with some families of languages and also certain variants of Watson-Crick finite automata. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/BIC-TA.2011.28 | BIC-TA |
Keywords | Field | DocType |
complementarity relation,strings u,generative power,context-free systems,double-stranded string,context-free type,watson-crick context-free system,upper strand,watson-crick finite automaton,generative device,watson-crick l system,regular language,context free languages,finite automata,finite automaton,context free language,context free grammar | Complementarity (molecular biology),Discrete mathematics,Context-free language,Mathematical optimization,Nondeterministic finite automaton,Deterministic finite automaton,Algorithm,Finite-state machine,Formal grammar,Rewriting,Regular language,Mathematics | Conference |
Citations | PageRank | References |
1 | 0.39 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. G. Subramanian | 1 | 339 | 59.27 |
| Ibrahim Venkat | 2 | 70 | 14.37 |
| Kalpana Mahalingam | 3 | 135 | 21.42 |