Abstract.
A substitution naturally determines a directed graph with an ordering of the edges incident at each vertex. We describe a simple method by which any primitive substitution can be modified (without materially changing the bi-infinite fixed points of the substitution) so that points in the substitution minimal shift are in bijective correspondence with one-sided infinite paths on its associated directed graph. Using this correspondence, we show that primitive substitutive sequences in the substitution minimal shift are precisely those sequences represented by eventually periodic paths. We use directed graphs to show that all measures of cylinders in a substitution minimal shift lie in a finite union of geometric sequences, confirming a conjecture of Boshernitzan. Our methods also yield sufficient conditions for a geometric realization of a primitive substitution to be ``almost injective.''
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Author information
Authors and Affiliations
Additional information
Received January 24, 2000, and in final form August 9, 2001. Online publication November 23, 2001.
Rights and permissions
About this article
Cite this article
Holton, C., Zamboni, L. Directed Graphs and Substitutions . Theory Comput. Systems 34, 545–564 (2001). https://doi.org/10.1007/s00224-001-1038-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-001-1038-y