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)
DNA Complementarity and Paradigms of Computing
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On some biologically motivated control devices for parallel rewriting
Computation, cooperation, and life
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 | 0.00 |
D0L systems consist of iterated letter-to-string morphism over a finite alphabet. Their descriptional power is rather limited and their length sequences can be expressed as sum of products of polynomial and exponential functions. There were several attempts to enrich their structure by various types of regulation, see e.g. [1], leading to more powerful mechanisms. Due to increasing interest in biocomputing models, V. Mihalache and A. Salomaa suggested in 1997 Watson-Crick D0L systems with so called Watson-Crick morphism. This letter-to-letter morphism maps a letter to the complementary letter, similarly as a nucleotide is joined with the complementary one during transfer of genetic information. Moreover, this new morphism is triggered by a simple condition (called trigger), e.g. with majority of pyrimidines over purines in a string. This paper deals with the expressive power of standard Watson-Crick D0L systems. A rather unexpected result is obtained: any Turing computable function can be computed by a Watson-Crick D0L system.