Watson-Crick D0L systems with regular triggers

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