Abstract

Watson–Crick complementarity has been used as a basis for massive parallelism in DNA computing. Also its use in an operational sense has turned out to be very promising in the study of Watson–Crick D0L systems. The latter generalize D0L systems in a way not investigated so far in the theory of Lindenmayer systems. The complexity of the “trigger” is crucial for decidability properties concerning Watson–Crick D0L systems. The purpose of this paper is to settle the basic decision problems in the case of regular triggers.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.