A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Watson-Crick DOL systems with regular triggers
Tekijät: Honkala J, Salomaa A
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2001
Lehti: Theoretical Computer Science
Tietokannassa oleva lehden nimi: THEORETICAL COMPUTER SCIENCE
Lehden akronyymi: THEOR COMPUT SCI
Vuosikerta: 259
Numero: 1-2
Aloitussivu: 689
Lopetussivu: 698
Sivujen määrä: 10
ISSN: 0304-3975
DOI: https://doi.org/10.1016/S0304-3975(01)00010-X
Tiivistelmä
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 DOL systems. The latter generalize DOL 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 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.
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 DOL systems. The latter generalize DOL 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 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.
Avainsanat:
decidability, DOL sequences, Lindenmayer systems, Watson-Crick complementarity
Turun yliopiston Tutkimustietojärjestelmän portaali