Advertisement

A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems

  • Erzsébet Csuhaj-Varjú
  • Rudolf Freund
  • György Vaszil
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9288)

Abstract

Motivated by the conceptual similarity of a mind change of a red-green Turing machine and of a turn to the complementary word in Watson-Crick L systems as well as by the fact that both red-green Turing machines and Watson-Crick L systems define infinite runs, we establish a connection between the two areas of unconventional computing. We show that the sets of numbers which can be recognized by so-called standard Watson-Crick T0L systems coincide with those recognized by red-green register machines (or red-green Turing machines). The results imply that using Watson-Crick L systems we may “go beyond Turing” in a similar way as red-green register machines and red-green Turing machines can do.

Keywords

Turing Machine Green State Word Sequence Input Word Register Machine 
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.

References

  1. 1.
    Aman, B., Csuhaj-Varjú, E., Freund, R.: Red–green P automata. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Sosík, P., Zandron, C. (eds.) CMC 2014. LNCS, vol. 8961, pp. 139–157. Springer, Heidelberg (2014) Google Scholar
  2. 2.
    Budnik, P.: What Is and What Will Be. Mountain Math Software, Los Gatos (2006)zbMATHGoogle Scholar
  3. 3.
    Csima, J., Csuhaj-Varjú, E., Salomaa, A.: Power and size of extended Watson-Crick L systems. Theor. Comput. Sci. 290, 1665–1678 (2003)CrossRefGoogle Scholar
  4. 4.
    van Leeuwen, J., Wiedermann, J.: Computation as an unbounded process. Theor. Comput. Sci. 429, 202–212 (2012)CrossRefGoogle Scholar
  5. 5.
    Mihalache, V., Salomaa, A.: Language-theoretic aspects of DNA complementarity. Theor. Comput. Sci. 250, 163–178 (2001)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Păun, Gh.: (DNA) Computing by carving. Soft Comput. 3, 30–36 (1999)Google Scholar
  7. 7.
    Salomaa, A.: Uni-transitional Watson-Crick D0L systems. Theor. Comput. Sci. 281(1–2), 537–553 (2002)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Salomaa, A., Sosík, P.: Watson-Crick D0L systems: the power of one transition. Theor. Comput. Sci. 301, 187–200 (2003)CrossRefzbMATHGoogle Scholar
  9. 9.
    Sosík, P.: Watson-Crick D0L systems: generative power and undecidable problems. Theor. Comput. Sci. 306(1–2), 101–112 (2003)CrossRefGoogle Scholar
  10. 10.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1–3. Springer, Berlin (1997)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Erzsébet Csuhaj-Varjú
    • 1
  • Rudolf Freund
    • 2
  • György Vaszil
    • 3
  1. 1.Department of Algorithms and Their Applications, Faculty of InformaticsEötvös Loránd UniversityBudapestHungary
  2. 2.Faculty of InformaticsViennaAustria
  3. 3.Department of Computer Science, Faculty of InformaticsUniversity of DebrecenDebrecenHungary

Personalised recommendations