The Sequence Equivalence Problem for Marked DT0L Systems



: Honkala J

Publisher: IOS PRESS

: 2011

: Fundamenta Informaticae

: FUNDAMENTA INFORMATICAE

: FUND INFORM

: 1-4

: 110

: 1-4

: 175

: 182

: 8

: 0169-2968

DOI: https://doi.org/10.3233/FI-2011-535


We study the DT0L sequence equivalence problem for marked morphisms. We show that to decide this problem it is enough to consider initial terms involving at most 2n morphisms where n is the cardinality of the underlying alphabet.



Last updated on 2024-26-11 at 19:28