Computing by Observing Changes

  • Matteo Cavaliere
  • Peter Leupold
Part of the Proceedings in Information and Communications Technology book series (PICT, volume 2)


Computing by Observing is a paradigm for the implementation of models of Natural Computing. It was inspired by the setup of experiments in biochemistry. One central feature is an observer that translates the evolution of an underlying observed system into sequences over a finite alphabet. We take a step toward more realistic observers by allowing them to notice only an occurring change in the observed system rather than to read the system’s entire configuration. Compared to previous implementations of the Computing by Observing paradigm, this decreases the computational power; but with relatively simple systems we still obtain the language class generated by matrix grammars.


Painter System Language Class Input Word Empty String Input Alphabet 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Book, R., Otto, F.: String-Rewriting Systems. Springer, Berlin (1993)MATHGoogle Scholar
  2. 2.
    Cavaliere, M., Frisco, P., Hoogeboom, H.J.: Computing by Only Observing. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 304–314. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Cavaliere, M., Leupold, P.: Computing by Observing: Simple Systems and Simple Observers (2009) (submitted)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Cavaliere, M., Leupold, P.: Evolution and Observation — A Non-Standard Way to Generate Formal Languages. Theoretical Computer Science 321, 233–248 (2004)CrossRefMathSciNetMATHGoogle Scholar
  6. 6.
    Cavaliere, M., Leupold, P.: Observation of String-Rewriting Systems. Fundamenta Informaticae 74(4), 447–462 (2006)MathSciNetMATHGoogle Scholar
  7. 7.
    Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)Google Scholar
  8. 8.
    Ginsburg, S., Spanier, E.H.: Control Sets on Grammars. Mathematical Systems Theory 2(2), 159–177 (1968)CrossRefMathSciNetMATHGoogle Scholar
  9. 9.
    Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. Theoretical Comput. Sci. 327(3), 301–317 (2004)CrossRefMathSciNetMATHGoogle Scholar
  10. 10.
    Kasai, T.: An Hierarchy Between Context-Free and Context-Sensitive Languages. Journal of Computer and Systems Sciences 4(5), 492–508 (1970)CrossRefMathSciNetMATHGoogle Scholar
  11. 11.
    Moriya, E.: Associate languages and derivational complexity of formal grammars and languages. Information and Control 22, 139–162 (1973)CrossRefMathSciNetMATHGoogle Scholar
  12. 12.
    Salomaa, A.: Formal Languages. Academic Press, New York (1973)MATHGoogle Scholar

Copyright information

© Springer Tokyo 2010

Authors and Affiliations

  • Matteo Cavaliere
    • 1
  • Peter Leupold
    • 2
  1. 1.CoSBiTrentoItaly
  2. 2.Department of Mathematics, Faculty of ScienceKyoto Sangyo UniversityKyotoJapan

Personalised recommendations