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
Authors: Honkala J
Publisher: SPRINGER-VERLAG
Publication year: 2003
Journal: Theory of Computing Systems
Journal name in source: THEORY OF COMPUTING SYSTEMS
Journal acronym: THEOR COMPUT SYST
Volume: 36
Issue: 1
First page : 89
Last page: 103
Number of pages: 15
ISSN: 1432-4350
DOI: https://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.
We give abound for the sequence equivalence problem of polynomially bounded DOL systems which depends only on the size of the underlying alphabet.