Abstract
We study the language equivalence problem for smooth and loop-free D0L systems. We show that the number of initial terms in the associated D0L sequences we have to consider to decide language equivalence depends only on the cardinality of the underlying alphabet.
Similar content being viewed by others
References
Honkala, J.: Bounds for the D0L language equivalence problem. Inf. Comput. 190, 70–80 (2004)
Honkala, J.: A new bound for the D0L sequence equivalence problem. Acta Inform. 43, 419–429 (2007)
Nielsen, M.: On the decidability of some equivalence problems for D0L systems. Inf. Control 25, 166–193 (1974)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1–3. Springer, Berlin (1997)
Salomaa, A.: Simple reductions between D0L language and sequence equivalence problems. Discrete Appl. Math. 41, 271–274 (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Honkala, J. A new bound for the D0L language equivalence problem. Acta Informatica 55, 81–88 (2018). https://doi.org/10.1007/s00236-016-0286-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-016-0286-x