Abstract
A very common approach in chemistry and biology is to observe the progress of an experiment, and take the result of this observation as the final output. Inspired by this, a new approach to computing, called system/observer, was introduced in [3].
In this paper we apply this strategy to sticker systems, [8,11]. In particular we use finite automata (playing the role of observer) watching the “evolution” of a sticker system and translating such “evolution” into a readable output.
We show that this way of “computing by observing” brings us results quite different from the ones obtained when considering sticker systems in the standard manner. Even regular simple sticker systems (whose generative power is subregular) become universal when considered in this new framework. The significance of these results for DNA computing (by sticker systems) is briefly discussed.
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
Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science 226, 1021–1024 (1994)
Alhazov, A., Caveliere, M.: Computing by Observing Bio-Systems: the Case of Sticker Systems. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) Preliminary Proceedings of Tenth International Meeting on DNA Computing (DNA 10), pp. 324–333. University of Milano-Bicocca, Milan (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 (accepted)
Cavaliere, M., Jonoska, N. (Computing by) Observing Splicing Systems. manuscript (2004)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Heidelberg (1989)
Freund, R.: Bidirectional Sticker Systems and Representations of RE Languages by Copy Languages. In: Păun, G. (ed.) Computing with Bio-Molecules: Theory and Experiments, pp. 182–199. Springer, Singapore (1998)
Kari, L., Păun, G., Rozenberg, G., Salomaa, A., Yu, S.: DNA computing, sticker systems, and universality. Acta Informatica 35(5), 401–420 (1998)
Ha, T.: Single-Molecule Fluorescence Resonance Energy Transfer. Methods 25, 78–86 (2001)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing - New Computing Paradigms. Springer, Berlin (1998)
Rozenberg, G., Salomaa, A.: Watson-Crick Complementarity, Universal Computations and Genetic Engineering, Technical Report 96-28, Dept. of Computer Science, Leiden University (1996)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
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
Alhazov, A., Cavaliere, M. (2005). Computing by Observing Bio-systems: The Case of Sticker Systems. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_1
Download citation
DOI: https://doi.org/10.1007/11493785_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26174-2
Online ISBN: 978-3-540-31844-6
eBook Packages: Computer ScienceComputer Science (R0)