A1 Refereed original research article in a scientific journal

The equivalence problem of polynomially bounded D0L systems - a bound depending only on the size of the alphabet




AuthorsHonkala J

PublisherSPRINGER-VERLAG

Publication year2003

JournalTheory of Computing Systems

Journal name in sourceTHEORY OF COMPUTING SYSTEMS

Journal acronymTHEOR COMPUT SYST

Volume36

Issue1

First page 89

Last page103

Number of pages15

ISSN1432-4350

DOIhttps://doi.org/10.1007/s00224-002-1075-1(external)


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



Last updated on 2024-26-11 at 20:08