Authors:
Lakshmanan Kuppusamy
1
;
Anand Mahendran
1
and
Shankara Krishna Narayanan
2
Affiliations:
1
VIT University, India
;
2
IIT Bombay, India
Keyword(s):
non-context-free languages, bio-molecular structures, insertion-deletion systems, matrix grammars, recursively enumerable languages.
Abstract:
Insertion and deletion are considered to be the basic operations in Biology, more specifically in DNA processing and RNA editing. Based on these evolutionary transformations, a computing model insertion-deletion system has been proposed in formal language theory. Recently, in [14], a new computing model named Matrix insertion-deletion system has been introduced to model various bio-molecular structures. In this paper, we represent some natural language constraints such as triple agreement, crossed dependency, copy language using Matrix insertion-deletion systems and discuss how these constraints resemble some bio-molecular structures. Next, we analyze the computational completeness result for Matrix insertion-deletion system where the importance is given for not using any contexts when deletion rule takes place.We see that when the insertion-deletion system is combined with matrix grammar, the universality result is obtained with weight just 3 (1, 1; 1, 0) whereas for insertion-delet
ion systems, the universality result is available with weight 4 (1, 1; 1, 1).
(More)