Skip to main content
SpringerLink
Log in

The Equivalence Problem of Polynomially Bounded D0L Systems— a Bound Depending Only on the Size of the Alphabet

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Abstract. We give a bound for the sequence equivalence problem of polynomially bounded D0L systems which depends only on the size of the underlying alphabet.

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

Access this article

Log in via an institution

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

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, juha.honkala@utu.fi, FIN-20014 Turku, Finland, FI

    Juha Honkala

Authors
  1. Juha Honkala
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Honkala, J. The Equivalence Problem of Polynomially Bounded D0L Systems— a Bound Depending Only on the Size of the Alphabet . Theory Comput. Systems 36, 89–103 (2003). https://doi.org/10.1007/s00224-002-1075-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-002-1075-1

Keywords

Search

Navigation