Abstract
In this article 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alhazov, A., Krassovitskiy, A., Rogozhin, Y.: Circular Post Machines and P Systems with Exo-insertion and Deletion. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds.) CMC 2011. LNCS, vol. 7184, pp. 73–86. Springer, Heidelberg (2012)
Alhazov, A., Krassovitskiy, A., Rogozhin, Y., Verlan, S.: P systems with minimal insertion and deletion. Theor. Comp. Sci. 412(1-2), 136–144 (2011)
Alhazov, A., Krassovitskiy, A., Rogozhin, Y., Verlan, S.: P systems with insertion and deletion exo-operations. Fundamenta Informaticae 110(1-4), 13–28 (2011)
Benne, R.: RNA Editing: The Alteration of Protein Coding Sequences of RNA. Ellis Horwood, Chichester (1993)
Biegler, F., Burrell, M.J., Daley, M.: Regulated RNA rewriting: Modelling RNA editing with guided insertion. Theor. Comput. Sci. 387(2), 103–112 (2007)
Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.M.: Solving NP-Complete Problems With Networks of Evolutionary Processors. In: Mira, J., Prieto, A.G. (eds.) IWANN 2001, Part I. LNCS, vol. 2084, pp. 621–628. Springer, Heidelberg (2001)
Csuhaj-Varjú, E., Salomaa, A.: Networks of Parallel Language Processors. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 299–318. Springer, Heidelberg (1997)
Dassow, J., Manea, F.: Accepting hybrid networks of evolutionary processors with special topologies and small communication. In: Proc. DCFS 2010, pp. 68–77 (2010)
Dassow, J., Manea, F., Truthe, B.: On Normal Forms for Networks of Evolutionary Processors. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds.) UC 2011. LNCS, vol. 6714, pp. 89–100. Springer, Heidelberg (2011)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer (1989)
Freund, R., Kogler, M., Rogozhin, Y., Verlan, S.: Graph-controlled insertion-deletion systems. In: McQuillan, I., Pighizzini, G. (eds.) Proc. of 12th Workshop on Descriptional Complexity of Formal Systems. EPTCS, vol. 31, pp. 88–98 (2010)
Freund, R., Oswald, M., Păun, A.: 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–203 (2004)
Galiukschov, B.: Semicontextual grammars. Logica i Matem. Lingvistika, 38–50 (1981) (in Russian)
Haussler, D.: Insertion and Iterated Insertion as Operations on Formal Languages. PhD thesis, Univ. of Colorado at Boulder (1982)
Haussler, D.: Insertion languages. Information Sciences 31(1), 77–89 (1983)
Ivanov, S., Verlan, S.: Random context and semi-conditional insertion-deletion systems. arXiv, CoRR abs/1112.5947 (2011)
Kari, L.: On Insertion and Deletion in Formal Languages. PhD thesis, University of Turku (1991)
Kari, L., Păun, G., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: Characterizing RE using insertion-deletion systems. In: Proc. of 3rd DIMACS Workshop on DNA Based Computing, Philadelphia, pp. 318–333 (1997)
Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Computational power of insertion-deletion (P) systems with rules of size two. Natural Computing 10(2), 835–852 (2011)
Marcus, S.: Contextual Grammars. Rev. Roum. Math. Pures Appl. 14, 1525–1534 (1969)
Margenstern, M., Mitrana, V., Jesús Pérez-Jímenez, M.: Accepting Hybrid Networks of Evolutionary Processors. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA10. LNCS, vol. 3384, pp. 235–246. Springer, Heidelberg (2005)
Margenstern, M., Păun, G., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theor. Comput. Sci. 330(2), 339–348 (2005)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
Păun, G.: Membrane Computing. An Introduction. Springer (2002)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer (1998)
Păun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press (2010)
Petre, I., Verlan, S.: Matrix insertion-deletion systems. arXiv, CoRR abs/1012.5248 (2010)
The P systems Web page, http://ppage.psystems.eu/
Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 3. Springer, Heidelberg (1997)
Verlan, S.: On minimal context-free insertion-deletion systems. J. of Automata, Languages and Combinatorics 12(1-2), 317–328 (2007)
Verlan, S.: Recent developments on insertion-deletion systems. Comp. Sci. J. of Moldova 18(2), 210–245 (2010)
Verlan, S.: Study of language-theoretic computational paradigms inspired by biology. Habilitation thesis, University of Paris Est (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freund, R., Rogozhin, Y., 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. UCNC 2012. Lecture Notes in Computer Science, vol 7445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32894-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-32894-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32893-0
Online ISBN: 978-3-642-32894-7
eBook Packages: Computer ScienceComputer Science (R0)