On Representing Natural Languages and Bio-molecular Structures using Matrix Insertion-deletion Systems and its Computational Completeness

Lakshmanan Kuppusamy, Anand Mahendran, Shankara Krishna Narayanan

2011

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-deletion systems, the universality result is available with weight 4 (1, 1; 1, 1).

References

  1. Akihiro Takaharai., Takashi Yokomori.: On the computational power of insertion-deletion systems, Natural Computing 2, pp. 321-36: Kluwer Academic Publishers, (2003)
  2. Arto Salomaa.: Formal languages, New York and London: Academic Press, (1973)
  3. Aravind K. Joshi.: An introduction to tree adjoining grammars. In Manaster-Ramer (ed.), Mathematics of Languages, John Benjamins, Amsterdam, Philadelphia, pp. 87-114, (1988)
  4. Bar-Hillel., Shamir E.: Finite state languages: formal representations and adequacy problems. In: Bar Hillel (ed.), Lang. and Infn.: Addison-Wesley, Reading, MA, pp. 87-98, (1964)
  5. Boullier P.: Range concatenation grammars. Proceedings of Sixth International Workshop on Parsing Technologies (IWPT), pp. 53-64 (2000)
  6. Cristian S. Calude., Gheorghe Pau?n.: Computing with cells and atoms, An introduction to Quantum, DNA and Membrane Computing, London: Taylor and Francis, (2001)
  7. David B. Searls.: Representing genetic information with formal grammars. In: Proceedings of the National Conference on Artificial Intelligence. pp. 386-391, (1988)
  8. David B. Searls.: The linguistics of DNA. American Scientist. pp. 579-591, (1992)
  9. David B. Searls.: The computational linguistics of biological sequences. In: Hunter, L.(ed.) Artificial Intelligence and Molecular Biology, AAAI Press, pp. 47-120, (1993)
  10. Elena Rivas., Sean R. Reddy.: The language of RNA: A formal grammar that includes pseudoknots, Bioinformatics, vol 16. pp. 334-340, (2000)
  11. Gheorghe Pa?un., Grzegorz Rozenberg., Arto Salomaa.: DNA Computing, New Computing Paradigms. Springer, (1998)
  12. Gheorghe Pa?un.: Membrane Computing-An introduction. Springer, (2002)
  13. John E. Hopcroft., Rajeev Motwani., Jeffrey D. Ullman.: Introduction to Automata Theory, Languages and Computation: Addison-Wesley, (2006)
  14. Lakshmanan Kuppusamy., Anand Mahendran., Krishna S.: Matrix Insertion-Deletion Systems for Bio-molecular Structures, Submitted (to ICDCIT-2011), Aug (2010)
  15. Lakshmanan Kuppusamy., Krishna S.N., Rama R.: Internal contextual grammars for mildly context sensitive languages, Research on Language and Computation, 5, pp. 181-197, (2007)
  16. Lila Kari., Gheorghe Pa?un., G. Thierrin., S. Yu.: At the crossroads of DNA computing and formal languages: Characterizing RE using insertion-deletion systems. Proc. of 3rd DIMACS Workshop on DNA Based Computing, Philadelphia, pp. 318333, (1997)
  17. Maurice Margenstern., Gheorghe Pa?un., Yurii Rogozhin., Sergey Verlan.: Context-free insertiondeletion systems, Theoretical Computer Science, 330, pp.339-348,(2005)
  18. Rozenberg., Arto Salomaa.: Handbook of formal languages, Vol 1,2,3, Springer, (1997)
  19. Solomon Marcus., Carlos Martin-Vide., Gheorghe Pa?un.: Contextual grammars as generative models of natural languages, Volume 24 , Issue 2, pp. 245-274, (1998)
  20. Yasuo Uemura., Aki Hasegawa., Satoshi Kobayashi., Takashi Yokomori.: Tree adjoining grammars for RNA structure prediction. Theoretical Computer Science, 210: pp. 277-303, (1999)
Download


Paper Citation


in Harvard Style

Kuppusamy L., Mahendran A. and Krishna Narayanan S. (2011). On Representing Natural Languages and Bio-molecular Structures using Matrix Insertion-deletion Systems and its Computational Completeness . In Proceedings of the 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology - Volume 1: BILC, (ICAART 2011) ISBN 978-989-8425-42-3, pages 47-56. DOI: 10.5220/0003308900470056


in Bibtex Style

@conference{bilc11,
author={Lakshmanan Kuppusamy and Anand Mahendran and Shankara Krishna Narayanan},
title={On Representing Natural Languages and Bio-molecular Structures using Matrix Insertion-deletion Systems and its Computational Completeness},
booktitle={Proceedings of the 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology - Volume 1: BILC, (ICAART 2011)},
year={2011},
pages={47-56},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003308900470056},
isbn={978-989-8425-42-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology - Volume 1: BILC, (ICAART 2011)
TI - On Representing Natural Languages and Bio-molecular Structures using Matrix Insertion-deletion Systems and its Computational Completeness
SN - 978-989-8425-42-3
AU - Kuppusamy L.
AU - Mahendran A.
AU - Krishna Narayanan S.
PY - 2011
SP - 47
EP - 56
DO - 10.5220/0003308900470056