Skip to main content
SpringerLink
Log in

A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem

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

Abstract.

All known bounds for the D0L sequence equivalence problem in the general case are huge. We give a bound for polynomially bounded PD0L systems which is less than cubic with respect to the cardinality of the alphabet and the size of the systems.

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, and Turku Centre for Computer Science (TUCS),Lemminkäisenkatu 14, FIN-20520 Turku, Finland, University of Turku, FIN-20014 Turku, Finland juha.honkala@utu.fi, FI

    J. Honkala

Authors
  1. J. Honkala
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received June 13, 2000, and in final form October 26, 2000. Online publication February 20, 2001.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Honkala, J. A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem . Theory Comput. Systems 34, 263–272 (2001). https://doi.org/10.1007/s00224-001-0001-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-001-0001-2

Keywords

Search

Navigation