Show simple item record

dc.contributor.authorVoorhees, Burt
dc.descriptionThe paper was presented on Oct. 10 and will be published in a special issue of Journal of Cellular Automata. There was some useful discussion following on the presentation, including amazement that I had computed some of the results by hand rather than using a computer.en
dc.description.abstractThis paper considers binary valued additive cellular automata rules acting on cylinders of size n in terms of circulant matrices and roots of unity. The purpose is to illustrate some of the possibilities of such an approach. Means of determining maximum tree heights and cycle periods are given, together with a method of computing conditions for states to be fixed points or to lie on cycles of given periods. The anomalous shifts that lead to maximum cycle periods being smaller than predicted for certain cylinder sizes are explained and it is shown that the set of all rules on cylinders of odd size n will have specific spectra of cycle periods determined by the prime decomposition of n. Finally, numeric properties of the n-th roots of unity when coupled with mod(2) arithmetic are exploited to group additive rules acting on a cylinder of size n into classes having the same eigenvalues for their circulant matrix representations.en
dc.subjectCellular automataen
dc.titleAnalysis of Additive Binary Valued Cellular Automata Using Roots of Unityen

Files in this item


This item appears in the following Collection(s)

Show simple item record

AU logo
Athabasca University Library & Scholarly Resources
Phone: (800) 788-9041 ext 6254 | Email:
Fax: (780) 675-6477 | Hours: Monday-Friday 8:30am - 4:30pm (MT) | Privacy
Focused on the future of learning.