The equality problem for infinite words generated by primitive morphisms
classification
💻 cs.FL
keywords
morphismswordsequalitygeneratedinfiniteprimitiveproblemalgorithm
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.