Extended Watson-Crick L Systems with Regular Trigger Languages
Watson-Crick Lindenmayer systems (L systems) add a control mechanism to ordinary L system derivations. The mechanism is inspired by the complementarity relation in DNA strings, and it is formally defined in terms of a trigger language (trigger, for short). In this paper we prove that Uni-Transitional Watson-Crick E0L systems with regular triggers can recognize the recursively enumerable (RE) languages. We also find that even if the trigger is nondeterministically applied and the number of its applications can be unbounded then the computational power does not change. In the case where the number of applications of the trigger is bounded we find that the computational power lies within the ET0L languages. We also find that Watson-Crick ET0L systems where the number of complementary transitions is bounded by any natural number are equivalent in expressive power.
KeywordsDerivation Step Deterministic Finite Automaton Derivation Mode Complementary Transition Valid Simulation
Unable to display preview. Download preview PDF.
- 4.Csuhaj-Varjú, E.: Computing by networks of Watson-Crick D0L systems. In: Ito, M. (ed.) Algebraic Systems, Formal Languages and Computation. RIMS Kokyroku 1166, Research Institute for Mathematical Sciences, pp. 43–51. Kyoto University, Kyoto (August 2000)Google Scholar
- 6.Mihalache, V., Salomaa, A.: Lindenmayer and DNA: Watson-Crick D0L Systems. Bulletin of the EATCS 62 (1997)Google Scholar
- 11.Salomaa, A.: Turing, Watson-Crick And Lindenmayer. Aspects Of DNA Complementarity. In: Calude, C., Casti, J., Dinneen, M.J. (eds.) Unconventional Models of Computation, pp. 94–107. Springer, Heidelberg (1997)Google Scholar
- 14.Sears, D.: The Computational Power of Extended Watson-Crick L Systems. Master’s thesis, School of Computing, Queen’s University, Kingston, Ontario, Canada (2010), http://hdl.handle.net/1974/6224