Abstract
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.
Filter Results
Select search scope: search across all journals or within the current journal
Search this journal
Enter search terms…
/