Michael S. Keane; Adam Fieldsteel; David A. Constantine
Substitutions map symbols within a finite set to longer strings within the set. Linear algebra and probability can be used to determine the similarity of substitution sequences as their lengths approach infinity by examining the coincidences between the sequences. Some sequences coincide at a steady rate, called the coincidence limit, while others will not. The goal is to demonstrate types of substitutions that can and cannot yield coincidence limits, using results established by P. Michel, M. Dekking, et al., and showing new results based on the author's research.
Hoffman, Ian, "Coincidences of Substitution Systems" (2013). Masters Theses. 40.
© Copyright is owned by author of this document