Splicing Context-Free Matrix Grammars using Parallel Communicating Grammar Systems
PM. Iffath Mubeen1, J.D.Emerald2
1M. Iffath Mubeen, Assistant Professor, Department of Mathematics, Government Arts College for Men, Chennai, Tamil Nadu, India.
2J.D.Emerald, Assistant Professor, Department of Mathematics, Queen Mary’s College, Chennai, Tamil Nadu, India.
Manuscript received on September 19, 2019. | Revised Manuscript received on 25 September, 2019. | Manuscript published on October 10, 2019. | PP: 1281-1283 | Volume-8 Issue-12, October 2019. | Retrieval Number: L39131081219/2019©BEIESP | DOI: 10.35940/ijitee.L3913.1081219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Extensive research on splicing of strings in DNA computing has established important theoretical results in computational theory. Further, splicing on strings has been extended to arrays in. In this context, we propose, a grammar system, using queries to splice context-free matrix grammars and show that the language generated by this grammar system is incomparable to the language given in  and has more generative power than in .
Keywords: language, DNA, Communicating
Scope of the Article: Parallel Computing