Skip to main content
Log in

A new bound for the D0L language equivalence problem

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Honkala, J.: Bounds for the D0L language equivalence problem. Inf. Comput. 190, 70–80 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Honkala, J.: A new bound for the D0L sequence equivalence problem. Acta Inform. 43, 419–429 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Nielsen, M.: On the decidability of some equivalence problems for D0L systems. Inf. Control 25, 166–193 (1974)

    Article  MATH  Google Scholar 

  4. Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)

    MATH  Google Scholar 

  5. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1–3. Springer, Berlin (1997)

    MATH  Google Scholar 

  6. Salomaa, A.: Simple reductions between D0L language and sequence equivalence problems. Discrete Appl. Math. 41, 271–274 (1993)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juha Honkala.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-016-0286-x

Navigation