JUCS - Journal of Universal Computer Science 7(10): 886-892, doi: 10.3217/jucs-007-10-0886
Three Variants of the DT0L Sequence Equivalence Problem
expand article infoJuha Honkala‡
‡ Department of Mathematics University of Turku and Turku Centre for Computer Science (TUCS), Turku, Finland

Corresponding author: Juha Honkala ( juha.honkala@utu.fi )

© Juha Honkala.
This article is freely available under the J.UCS Open Content License.
Citation: Honkala J (2001) Three Variants of the DT0L Sequence Equivalence Problem. JUCS - Journal of Universal Computer Science 7(10): 886-892. https://doi.org/10.3217/jucs-007-10-0886
Open Access
Abstract
We discuss three variants of the DT0L sequence equivalence problem. One of the variants generalizes the sequence equivalence problem of D0L systems for DT0L systems.
Keywords
Lindenmayer system, equivalence problem, decidability