Decidability results for Watson-Crick D0L systems with nonregular triggers



: Honkala J

Publisher: ELSEVIER SCIENCE BV

: 2003

: Theoretical Computer Science

: THEORETICAL COMPUTER SCIENCE

: THEOR COMPUT SCI

: 302

: 1-3

: 481

: 488

: 8

: 0304-3975

DOI: https://doi.org/10.1016/S0304-3975(03)00087-2


We show that sequence equivalence, language equivalence, growth equivalence and road equivalence are decidable for standard Watson-Crick D0L systems having bounded balance. (C) 2003 Elsevier Science B.V. All rights reserved.



Last updated on 2024-26-11 at 16:06