The Sequence Equivalence Problem for Marked DT0L Systems
Juha Honkala · Fundamenta Informaticae · 2011
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.