Easy cases of the D0L sequence equivalence problem

AbstractTo test the equivalence of two binary D0L sequences it suffices to compare the first four terms of the sequences. We introduce a larger class of D0L systems for which sequence equivalence can be decided by considering the first ten initial terms