General Features of W-Rule Cellular Automata

Olu Lafe
QuickCAT Technologies

A class of cellular automata described by a concise rule system known as W-Rule will be presented. We will show how W-Rule is a compact way of representing multi-state and multi-dimensional cellular automata in any arbitrary neighborhood configuration and size. Special properties such as periodicity and reversibility will be examined. We will discuss the relationship between the period and the parameters characterizing the cellular automata. We conclude by presenting the parameter determination technique and showcase the applicability of W-Rule to data encryption.

Created by Mathematica  (April 20, 2004)

Program Outline
Photo Scrapbook

NKS 2007
NKS 2006
NKS 2003