The Sequence Equivalence Problem for Marked DT0L Systems

作者：Honkala Juha^*

来源：Fundamenta Informaticae, 2011, 110(1-4): 175-182.

DOI：10.3233/FI-2011-535

• DT0L system
• DT0L sequence equivalence problem
• marked morphism
• decidability

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.

• 出版日期2011