Abstract
Computing by Observing is a theoretical model for computation that tries to formalize the standard setup of experiments in natural sciences. We establish that insertion systems with empty contexts and only one inserted letter suffice in this architecture to accept all recursively enumerable languages. While so far in most cases context-free power was needed, here a sub-regular system leads to computational completeness in this context. Further, we investigate more complicated insertion systems in a model with less powerful observer called Observing Change.
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., Verlan, S.: Small Size Insertion and Deletion Systems. In: Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory. Scientific Applications of Language Methods, vol. 2, pp. 459–524. World Scientific (2010)
Alhazov, A., Cavaliere, M.: Computing by Observing Bio-systems: The Case of Sticker Systems. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 1–13. Springer, Heidelberg (2005)
Cavaliere, M., Jonoska, N., Leupold, P.: Recognizing DNA splicing. Natural Computing 9(1), 157–170 (2009)
Cavaliere, M., Leupold, P.: Evolution and Observation: A New Way to Look at Membrane Systems. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 70–87. Springer, Heidelberg (2004)
Cavaliere, M., Leupold, P.: Evolution and observation — a non-standard way to generate formal languages. Theoretical Computer Science 321, 233–248 (2004)
Cavaliere, M., Leupold, P.: Observation of string-rewriting systems. Fundamenta Informaticae 74(4), 447–462 (2006)
Cavaliere, M., Leupold, P.: Computing by Observing Changes. In: Peper, F., Umeo, H., Matsui, N., Isokawa, T. (eds.) IWNC 2009. PICT, vol. 2, pp. 133–140. Springer, Heidelberg (2010)
Dassow, J., Mitrana, V., Salomaa, A.: Operations and language generating devices suggested by the genome evolution. Theor. Comput. Sci. 270(1-2), 701–738 (2002)
Galiukschov, B.S.: Semicontextual grammars. Matem. Logica i Matem. Lingvistika, 38–50 (1981) (in Russian)
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: Proceedings of 3rd DIMACS Workshop on DNA Based Computing, Philadelphia, pp. 318–333 (1997)
Kari, L., Sosík, P.: On the weight of universal insertion grammars. Theoretical Computer Science 396(1-3), 264–270 (2008)
Kari, L., Thierrin, G.: Contextual insertions/deletions and computability. Information and Computation 131(1), 47–61 (1996)
Krassovitskiy, A.: Complexity and Modeling Power of Insertion-Deletion Systems. Ph.D. thesis, Universitat Rovira i Virgili, Tarragona (2011)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing – New Computing Paradigms. Springer, Heidelberg (1998)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
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
Krassovitskiy, A., Leupold, P. (2012). Computing by Observing Insertion. In: Dediu, AH., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2012. Lecture Notes in Computer Science, vol 7183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28332-1_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-28332-1_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28331-4
Online ISBN: 978-3-642-28332-1
eBook Packages: Computer ScienceComputer Science (R0)