Advertisement

Natural Computing

, Volume 13, Issue 2, pp 257–268 | Cite as

Generating and accepting P systems with minimal left and right insertion and deletion

  • Rudolf Freund
  • Yurii Rogozhin
  • Sergey Verlan
Article

Abstract

In this paper we investigate the operations of insertion and deletion performed at the ends of a string. We show that using these operations in a P systems framework (which corresponds to using specific variants of graph control), computational completeness can even be achieved with the operations of left and right insertion and deletion of only one symbol, both in the generating as well as in the accepting case.

Keywords

Computational completeness Deletion Insertion Matrix grammars P systems 

References

  1. Alhazov A, Krassovitskiy A, Rogozhin Yu, Verlan S (2011a) P systems with minimal insertion and deletion. Theor Comput Sci 412(1–2):136–144CrossRefzbMATHMathSciNetGoogle Scholar
  2. Alhazov A, Krassovitskiy A, Rogozhin Yu, Verlan S (2011b) P systems with insertion and deletion exo-operations. Fundam Inform 110(1–4):13–28zbMATHMathSciNetGoogle Scholar
  3. Alhazov A, Krassovitskiy A, Rogozhin Yu (2012) Circular post machines and P systems with exo-insertion and deletion. In: Gheorghe M et al (eds) Membrane computing—12th international conference, CMC 2011, Fontainebleau, France, August 23–26, 2011, revised selected papers. Lecture notes in computer science 7184. Springer, New York, pp 73–86Google Scholar
  4. Benne R (1993) RNA editing: the alteration of protein coding sequences of RNA. Ellis Horwood, ChichesterGoogle Scholar
  5. Biegler F, Burrell MJ, Daley M (2007) Regulated RNA rewriting: modelling RNA editing with guided insertion. Theor Comput Sci 387(2):103–112CrossRefzbMATHMathSciNetGoogle Scholar
  6. Castellanos J, Martín-Vide C, Mitrana V, Sempere JM (2001) Solving NP-complete problems with networks of evolutionary processors. In: Mira J, Prieto AG (eds) IWANN 2001. Lecture notes in computer science 2084. Springer, New York, pp 621–628Google Scholar
  7. Csuhaj-Varjú E, Salomaa A (1997) Networks of parallel language processors. In: Păun Gh, Salomaa A (eds) New trends in formal languages. Lecture notes in computer science 1218. Springer, New York, pp 299–318Google Scholar
  8. Dassow J, Manea F (2010) Accepting hybrid networks of evolutionary processors with special topologies and small communication. In: McQuillan I, Pighizzini G (eds) Proceedings of the 12th workshop on descriptional complexity of formal systems, EPTCS 31, pp 68–77Google Scholar
  9. Dassow J, Păun Gh (1989) Regulated rewriting in formal language theory. Springer, New YorkCrossRefGoogle Scholar
  10. Dassow J, Manea F, Truthe B (2011) On normal forms for networks of evolutionary processors. In: Calude CS, Kari J, Petre I, Rozenberg G (eds) Proceedings of the unconventional computation 10th international conference, UC 2011, Turku, Finland, June 6–10, 2011. Lecture notes in computer science 6714, pp 89–100Google Scholar
  11. Freund R, Oswald M, Păun A (2004) Gemmating P systems are computationally complete with four membranes. In: Ilie L, Wotschke D (eds) Pre-proceedings DCFS 2004. The University of Western Ontario, Rep. No. 619, pp 191–203Google Scholar
  12. Freund R, Kogler M, Rogozhin Yu, Verlan S (2010) Graph-controlled insertion–deletion systems. In: McQuillan I, Pighizzini G (eds) Proceedings of the 12th workshop on descriptional complexity of formal systems, EPTCS 31, pp 88–98Google Scholar
  13. Freund R, Rogozhin Yu, Verlan S (2012) P systems with minimal left and right insertion and deletion. In: Durand-Lose J, Jonoska N (eds) Unconventional computation and natural computation, 11th international conference, UCNC 2012, Orleans, France, September 3–7, 2012. Lecture notes in computer science 7445. Springer, New York, pp 82–93Google Scholar
  14. Galiukschov B (1981) Semicontextual grammars. Logica i Matem. Lingvistika. Tallin University, pp 38–50 (in Russian)Google Scholar
  15. Haussler D (1982) Insertion and iterated insertion as operations on formal languages. PhD thesis, University of Colorado at Boulder, BoulderGoogle Scholar
  16. Haussler D (1983) Insertion languages. Inf Sci 31(1):77–89CrossRefzbMATHMathSciNetGoogle Scholar
  17. Ivanov S, Verlan S (2011) Random context and semi-conditional insertion–deletion systems. arXiv, CoRR abs/1112.5947Google Scholar
  18. Kari L (1991) On insertion and deletion in formal languages. PhD thesis, University of Turku, TurkuGoogle Scholar
  19. Kari L, Păun Gh, Thierrin G, Yu S (1997) At the crossroads of DNA computing and formal languages: characterizing RE using insertion–deletion systems. In: Rubin H, Wood DH (eds) DNA based computers III. Proceedings of the 3rd DIMACS workshop on DNA based computing, University of Pennsylvania, Philadelphia. DIMACS series in discrete mathematics and theoretical computer science 48, pp 318–333Google Scholar
  20. Krassovitskiy A, Rogozhin Yu, Verlan S (2011) Computational power of insertion–deletion (P) systems with rules of size two. Nat Comput 10(2):835–852CrossRefzbMATHMathSciNetGoogle Scholar
  21. Marcus S (1969) Contextual grammars. Rev Roum Math Pures Appl 14:1525–1534zbMATHGoogle Scholar
  22. Margenstern M, Mitrana V, Pérez-Jiménez M (2005a) Accepting hybrid networks of evolutionary systems. In: Ferretti C, Mauri G, Zandron C (eds) DNA computing: 10th international workshop on DNA computing, DNA10, Milan, Italy, June 7–10, 2004. Revised selected papers. Lecture notes in computer science 3384. Springer, New York, pp 235–246Google Scholar
  23. Margenstern M, Păun Gh, Rogozhin Yu, Verlan S (2005b) Context-free insertion–deletion systems. Theor Comput Sci 330(2):339–348CrossRefzbMATHGoogle Scholar
  24. Minsky ML (1967) Computation: finite and infinite machines. Prentice Hall, Englewood CliffszbMATHGoogle Scholar
  25. Păun Gh (2002) Membrane computing. An introduction. Springer, New YorkCrossRefzbMATHGoogle Scholar
  26. Păun Gh, Rozenberg G, Salomaa A (eds) (1998) DNA computing: new computing paradigms. Springer, New YorkzbMATHGoogle Scholar
  27. Păun Gh, Rozenberg G, Salomaa A (2010) The Oxford handbook of membrane computing. Oxford University Press, OxfordCrossRefzbMATHGoogle Scholar
  28. Petre I, Verlan S (2010) Matrix insertion–deletion systems. arXiv, CoRR abs/1012.5248Google Scholar
  29. Post EL (1943) Formal reductions of the general combinatorial decision problem. Am J Math 65(2):197–215CrossRefzbMATHMathSciNetGoogle Scholar
  30. Rozenberg G, Salomaa A (1997) Handbook of formal languages, 3 vols. Springer, New YorkCrossRefGoogle Scholar
  31. Verlan S (2007) On minimal context-free insertion–deletion systems. J Autom Lang Comb 12(1–2):317–328zbMATHMathSciNetGoogle Scholar
  32. Verlan S (2010a) Recent developments on insertion–deletion systems. Comput Sci J Moldova 18(2):210–245zbMATHMathSciNetGoogle Scholar
  33. Verlan S (2010b) Study of language-theoretic computational paradigms inspired by biology. Habilitation thesis, University of Paris Est, ParisGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.Faculty of InformaticsVienna University of TechnologyViennaAustria
  2. 2.Institute of Mathematics and Computer ScienceAcademy of Sciences of MoldovaChişinăuMoldova
  3. 3.LACL, Département InformatiqueUniversité Paris EstCréteilFrance

Personalised recommendations