a1 University of Copenhagen, Universitetsparken 5, 2100 Copenhagen Ø, Denmark; email@example.com
a2 School of Mathematical & Physical Sciences, Mathemathics Building - V123, University of Newcastle, University Drive, Callaghan NSW 2308, Australia.
a3 University of Copenhagen, Universitetsparken 5, 2100 Copenhagen Ø, Denmark; firstname.lastname@example.org
We present an algorithm which for any aperiodic and primitive substitution outputs a finite representation of each special word in the shift space associated to that substitution, and determines when such representations are equivalent under orbit and shift tail equivalence. The algorithm has been implemented and applied in the study of certain new invariants for flow equivalence of substitutional dynamical systems.
(Received July 5 2004)
(Accepted August 1 2006)
(Online publication September 25 2007)
Mathematics Subject Classification: