Arrow Research search
Back to I&C

I&C 2009

The equality problem for infinite words generated by primitive morphisms

Journal Article journal-article Computer Science ยท Theoretical Computer Science

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.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Information and Computation
Archive span
1987-2026
Indexed papers
3021
Paper id
108059340588697670
v2026.09.13