| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 434864 | Theoretical Computer Science | 2012 | 4 Pages |
Abstract
We show that to test the equivalence of two D0L sequences over an n-letter alphabet generated by marked morphisms it suffices to compare the first 2n+1 initial terms of the sequences. Under an additional condition it is enough to consider the 2n initial terms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
