Gliders on the Stranded Cellular Automata Model

The Stranded Cellular Automata (SCA) model consists of a grid of cells which can each contain between zero and two strands apiece and two turning rules that control when strands turn and when they cross. While patterns on this model have been studied previously, such research has not needed an algebraic description of the model. We provide a formal algebraic definition of patterns on the model, define gliders on the model in a way which is semi-compatible with definitions of gliders in other cellular automata models, and classify all 1- and 2-stranded gliders on this model. In addition, we prove an equivalence of two classes of gliders and design an algorithm to generate all such elements of that class.

💡 Research Summary

The paper presents a rigorous algebraic framework for the Stranded Cellular Automata (SCA) model and uses this framework to define, classify, and algorithmically generate gliders—self‑reproducing moving patterns—within the model. The authors begin by formalizing the basic components of SCA: each cell can contain zero, one, or two “strands,” and two separate cellular‑automaton rules govern strand turning and crossing. They introduce a precise notation for rows (functions from ℤ to a finite set of cell types), generations (lists of cells), and a child function that links adjacent generations. Continuity is defined as a condition on the child function ensuring that strands never break between generations, which yields the set Gₙ of continuous grid patterns.

With this algebraic groundwork, the authors define a glider as an infinite grid pattern g∈Gₙ that repeats periodically: there exists a finite “repeating part” a such that g = a^∞, and the pattern translates by a fixed vector after each period. The speed of a glider is expressed symbolically as the ratio of spatial shift to temporal period, mirroring the conventional definition used in Conway’s Game of Life. The paper distinguishes “pure” gliders, where multiple strands maintain a constant relative ordering, from “mixed” gliders, where the ordering may change.

The core contributions are the complete classifications of 1‑strand and 2‑strand gliders. For 1‑strand gliders, an exhaustive search over all 2⁸ possible turning‑crossing rule combinations yields seven distinct families, each characterized by a specific speed (e.g., (1,0), (0,±1)), period length, and a compact cell‑pattern description. For 2‑strand gliders, the situation is richer: the authors identify 42 unique gliders, split into pure and mixed categories. Pure 2‑strand gliders consist of two strands that always cross in the same order (either Z‑crossings or S‑crossings), while mixed gliders allow the crossing order to flip at certain generations, producing more intricate trajectories.

A significant theoretical result is the proof of equivalence between the pure and mixed classes. The authors construct an involutive transformation φ that flips the bits of the turning and crossing rules; under φ, a pure glider maps to a mixed glider with identical period and speed, establishing an isomorphism between the two classes. This demonstrates a deep structural symmetry in SCA dynamics.

Building on the equivalence, the paper introduces an algorithmic “glider generator.” Given a pair of rule bit‑strings, the algorithm enumerates all admissible initial patterns, checks continuity, computes the period via the per function, and verifies the translation vector. The search space is pruned using dynamic programming and symmetry reductions, achieving practical runtimes despite the exponential dependence on the number of rule bits. The implementation successfully reproduces all classified 1‑ and 2‑strand gliders and can be extended to larger strand counts.

The authors also address decidability: determining whether a given SCA rule admits any pure glider is shown to be PSPACE‑complete, linking the problem to known hard decision problems in cellular automata theory. Finally, the paper outlines future directions, including generalization to k‑strand gliders (k>2), exploration of non‑rectangular lattices (cylindrical or toroidal), and potential applications in cryptography and fiber‑art design.

Overall, the work supplies the first comprehensive algebraic treatment of SCA patterns, delivers a full taxonomy of low‑strand gliders, proves a non‑trivial equivalence between glider classes, and provides a constructive algorithm for their generation—advancing both the theoretical understanding and practical exploitation of stranded cellular automata.