A recursive introduction to the theory of computation
A recursive introduction to the theory of computation
Foundations of computing
Watson-Crick walks and roads on DOL graphs
Acta Cybernetica
Language-theoretic aspects of DNA complementarity
Theoretical Computer Science
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Extended Watson-Crick L systems with regular trigger languages
UC'11 Proceedings of the 10th international conference on Unconventional computation
Extended Watson---Crick L systems with regular trigger languages and restricted derivation modes
Natural Computing: an international journal
| Hi-index | 5.23 |
Watson-Crick D0L systems, introduced in 1997 by Mihalache and Salomaa, arise from two major principles: the Lindenmayer rewriting and the Watson-Crick complementarity principle. Complementarity can be viewed as a purely language-theoretic operation. Majority of a certain type of symbols in a string (purines vs. pyrimidines) triggers a transition to the complementary string. The paper deals with an expressive power of deterministic interactionless Watson-Crick Lindenmayer systems. A rather surprising result is obtained: these systems, consisting of iterated morphism and a basic DNA operation, are able to compute any Turing computable function.