Watson-Crick complementarity has been used as a basis for massive paralleli
sm in DNA computing. Also its use in an operational sense has turned out to
be very promising in the study of Watson-Crick DOL systems. The latter gen
eralize DOL systems in a way not investigated so far in the theory of Linde
nmayer systems. The complexity of the "trigger" is crucial for decidability
properties concerning Watson-Crick DOL systems. The purpose of this paper
is to settle the basic decision problems in the case of regular triggers. (
C) 2001 Elsevier Science B.V. All rights reserved.