We investigate the class of functions computable by uni-transitional Watson-Crick D0L systems: only one complementarity transition is possible during each derivation. The class is characterized in terms of a certain min-operation applied to Z-rational functions. We also exhibit functions outside the
✦ LIBER ✦
Watson–Crick D0L systems: generative power and undecidable problems
✍ Scribed by Petr Sosı́k
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 244 KB
- Volume
- 306
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Watson–Crick D0L systems: the power of o
✍
Arto Salomaa; Petr Sosı́k
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 254 KB
Uni-transitional Watson–Crick D0L system
✍
Arto Salomaa
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 154 KB
The phenomenon known as Watson-Crick complementarity is basic both in the experiments and theory of DNA computing. While the massive parallelism of DNA strands makes exhaustive searches possible, complementarity constitutes a powerful computational tool. It is also very fruitful to view complementar
Power and size of extended Watson–Crick
✍
Judit Csima; Erzsébet Csuhaj-Varjú; Arto Salomaa
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 143 KB
Decidability results for Watson–Crick D0
✍
Juha Honkala
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 197 KB