Document Type
Article
Publication Date
9-2023
First Advisor
Joshua Holden
Abstract
Cellular automata, such as the Stranded Cellular Automaton (SCA) model created by Joshua and Lana Holden, can be used to model weaving patterns. Similar models can be constructed to model macrame patterns, where strands are knotted together. If a rule is injective, then it is reversible. If a rule is surjective, then every configuration has at least one predecessor. In this paper, we will discuss the injectivity and surjectivity of several new SCA models in order to find reversible rules. We will also analyze the number of configurations with no predecessors and the number of configurations that map to the same successor.
Recommended Citation
Loyd, Allyn, "Reversibility of Stranded Cellular Automata" (2023). Mathematical Sciences Technical Reports (MSTR). 182.
https://scholar.rose-hulman.edu/math_mstr/182