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



: Honkala J

Publisher: SPRINGER-VERLAG

: 2003

: Theory of Computing Systems

: THEORY OF COMPUTING SYSTEMS

: THEOR COMPUT SYST

: 36

: 1

: 89

: 103

: 15

: 1432-4350

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


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