Abstract
The paradigm of evolution/observation is based on the idea that a computing device can be obtained by combining a basic system and an observer that transforms the evolution of the basic system into a readable output. In this framework we investigate what can be computed by changing the observer but not the basic observed system. We consider grammars as basic systems combined with finite state automata as observers, watching either the sequence of sentential forms or the productions used by the grammar. It is possible to obtain computational completeness only varying the observer, without modifying the basic system, which is a fixed context-free grammar.
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: 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. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol. 3892, pp. 12–26. Springer, Heidelberg (2006)
Cavaliere, M., Leupold, P.: Observation of string-rewriting systems. Fundamenta Informaticae (to appear)
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 accept formal languages. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 153–163. Springer, Heidelberg (2005)
Cavaliere, M., Leupold, P.: Evolution and observer: A non-standard way to generate formal languages. Theoretical Computer Science 321, 233–248 (2004)
Dassow, J., Păun, G.: Regulated rewriting in formal language theory. EATCS monographs in Theoretical computer science, vol. 18. Springer, Heidelberg (1989)
Fleck, A.C.: An analysis of Grammars by their derivation sets. Information and Control 24, 389–398 (1974)
Ginsburg, S.: Algebraic and automata-theoretic properties of formal languages, Foundamental studies in computer science, vol. 2. North-Holland, Amsterdam (1975)
Greibach, S.A.: A Note on Pushdown Store Automata and Regular Systems. Proceedings of the American Mathematical Society 18, 263–268 (1967)
Greibach, S.A.: Remarks on Blind and Partially Blind One-Way Multicounter Machines. Theoretical Computer Science 7, 311–324 (1978)
Leupold, P.: Non-universal G/O systems (submitted)
Mäkinen, E.: On contect-free derivations. PhD thesis, Acta Universitatis Tamperensis (1985)
Minsky, M.L.: Computation: Finite and Infinite Machines. In: Automatic computation. Prentice-Hall, Englewood Cliffs (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cavaliere, M., Frisco, P., Hoogeboom, H.J. (2006). Computing by Only Observing. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_28
Download citation
DOI: https://doi.org/10.1007/11779148_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35428-4
Online ISBN: 978-3-540-35430-7
eBook Packages: Computer ScienceComputer Science (R0)