The equality problem for infinite words generated by primitive morphisms

TL;DR

This paper presents a practical algorithm to determine whether two infinite words generated by primitive morphisms are equal, addressing a fundamental problem in the theory of infinite words.

Contribution

It introduces a new algorithm specifically designed to decide equality of infinite words produced by primitive morphisms, advancing the computational methods in formal language theory.

Findings

The algorithm successfully decides equality for a broad class of primitive morphism-generated words.

The method improves upon previous approaches in terms of efficiency and practicality.

The results have implications for automata theory and formal language analysis.

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.