| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436228 | Theoretical Computer Science | 2009 | 4 Pages |
Abstract
We study the simplification of infinite morphic words by using elementary morphisms. In particular, we give a new proof of a result of Cobham, stating that a morphic image of a morphic word is a finite word or a morphic word.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
