The equality problem for infinite words generated by primitive morphisms



: Honkala J

Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE

: 2009

: Information and Computation

: INFORMATION AND COMPUTATION

: INFORM COMPUT

: 207

: 8

: 900

: 907

: 8

: 0890-5401

DOI: https://doi.org/10.1016/j.ic.2009.01.002


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. (C) 2009 Elsevier Inc. All rights reserved



Last updated on 2024-26-11 at 14:46