Abstract
It is a very common procedure in biology to observe the progress of an experiment and regard the result of this observation as the final outcome. Inspired by this, a new approach for generating formal languages, called evolution/observation, has been introduced [6]. In the current work we consider evolution/observation as a new strategy also for accepting languages: a word is accepted, if the (observed) evolution of a certain system starting from this input follows a regular pattern.
We obtain the following result: checking if the (observed) evolution of a context-free system follows a regular pattern is enough to accept every recursively enumerable languages. On the other hand, if we observe the evolution of systems using very simple rules (of the kind a → b), then it is possible to accept exactly the class of context-sensitive languages.
This work was done, while both authors were funded by the Spanish Ministry of Culture, Education and Sport under the Programa Nacional de Formación de Profesorado Universitario (FPU).
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., Cavaliere, M.: Computing by Observing Bio-Systems: the Case of Sticker Systems. In: Pre-Proceedings of DNA 10 - Tenth International Meeting on DNA Computing, Milano (2004)
Asveld, P.R.J.: On controlled iterated gsm mappings and related operations. In: Preprint Math. Centrum, Amsterdam. Rev. Roum. Math. Pures (1979)
Bordihn, H., Fernau, H., Holzer, M.: Accepting Pure Grammars and Systems. Technical Report 1, Fakultät für Informatik, Universität Magdeburg (1999)
Cavaliere, M., Jonoska, N.: (Computing by) Observing Splicing Systems. Manuscript (2004)
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–88. 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)
Ha, T.: Single-Molecule Fluorescence Resonance Energy Transfer. Methods 25, 78–86 (2001)
Ilie, L., Salomaa, A.: 2-Testability and Relabelings Produce Everything. Journal of Computer and System Sciences 56(3), 253–262 (1998)
Manca, V., Martin-Vide, C., Păun, G.: Iterated GSM mappings: A collapsing hierarchy. In: Karhumaki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Jewels are Forever, pp. 182–193. Springer, Heidelberg (1999)
Păun, G.: On the iteration of gsm mappings. Rev. Roum. Math. Pures Appl. 23(4), 921–937 (1978)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Wagner, K., Wechsung, G.: Computational Complexity. Deutscher Verlag der Wissenschaften, Berlin (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cavaliere, M., Leupold, P. (2005). Evolution and Observation: A Non-standard Way to Accept Formal Languages. In: Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2004. Lecture Notes in Computer Science, vol 3354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31834-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-31834-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25261-0
Online ISBN: 978-3-540-31834-7
eBook Packages: Computer ScienceComputer Science (R0)