Proceedings ArticleDOI
Context-Free Systems with a Complementarity Relation
K. G. Subramanian,Ibrahim Venkat,Kalpana Mahalingam +2 more
- pp 194-198
TLDR
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 theString in the upper strand.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.read more
Citations
More filters
Proceedings ArticleDOI
On Watson-Crick automata
TL;DR: A Watson-Crick regular grammar that has rules as in a regular grammar but involves double stranded strings is introduced and some properties of these grammars are obtained and an application is indicated to generation of chain code pictures.
Journal ArticleDOI
Generative Power and Closure Properties of Watson-Crick Grammars
TL;DR: It is shown that WK linear grammars can generate some context-sensitive languages and it is established that the Watson-Crick regular Grammars are closed under almost all of the main closure operations.
Journal ArticleDOI
Watson–Crick Context-Free Grammars: Grammar Simplifications and a Parsing Algorithm
TL;DR: A modified CYK (Cocke–Younger–Kasami) algorithm for Watson–Crick context-free grammars in WK-Chomsky normal form, allowing to parse double-stranded strings in O(n^6) time.
Book ChapterDOI
The Computational Power of Watson-Crick Grammars: Revisited
TL;DR: Results concerning the generative power of Watson-Crick (regular, linear, context-free) grammars are presented and it is shown that the family of Watson -Crick context- free languages is included in thefamily of matrix languages.
References
More filters
Book
The mathematical theory of L systems
Grzegorz Rozenberg,Arto Salomaa +1 more
TL;DR: A survey of the different areas of the theory of developmental systems and languages in such a way that it discusses typical results obtained in each particular problem area.
Journal ArticleDOI
Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors.
TL;DR: This study initiates the formal analysis of the generative power of recombinational behaviors in general by means of a new generative formalism called a splicing system and a significant subclass of these languages, which are shown to coincide with a class of regular languages which have been previously studied in other contexts: the strictly locally testable languages.