| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435920 | Theoretical Computer Science | 2008 | 4 Pages |
Abstract
In this note we prove two cancellation properties of iterated morphisms and use these properties to give a simple method for deciding whether or not a given infinite D0L word is ultimately periodic.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
