The equality problem for infinite words generated by primitive morphisms
Formal Languages and Automata Theory
2009-04-16 v1
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.
Cite
@article{arxiv.0904.2257,
title = {The equality problem for infinite words generated by primitive morphisms},
author = {Juha Honkala},
journal= {arXiv preprint arXiv:0904.2257},
year = {2009}
}
Comments
Preliminary version of a paper to appear in Information and Computation