A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems
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.
KeywordsTuring Machine Green State Word Sequence Input Word Register Machine
- 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
- 6.Păun, Gh.: (DNA) Computing by carving. Soft Comput. 3, 30–36 (1999)Google Scholar
- 10.Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1–3. Springer, Berlin (1997)Google Scholar