The equality problem for infinite words generated by primitive morphisms

Simple item page
dc.creatorHonkala, Juha
dc.date2009-04-15
dc.date.accessioned2026-07-07T13:04:11Z
dc.date.available2026-07-07T13:04:11Z
dc.descriptionWe 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.
dc.descriptionPreliminary version of a paper to appear in Information and Computation
dc.identifierhttps://arxiv.org/abs/0904.2257
dc.identifierhttp://arxiv.org/abs/0904.2257
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227073
dc.subjectFormal Languages and Automata Theory
dc.subjectF.4.3
dc.titleThe equality problem for infinite words generated by primitive morphisms
dc.typetext

Files

Collections

arXiv