| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 426545 | Information and Computation | 2009 | 8 Pages |
Abstract
We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
