Issues on drawing the State Transition Diagram for arbitrary Cellular Automata

Abstract

This paper proposes several algorithms and their Cellular Automata Machine (CAM) for drawing the State Transition Diagram (STD) of an arbitrary Cellular Automata (CA) Rule (any neighborhood, uniform/ hybrid and null/ periodic boundary) and length of the CA n. It also discusses the novelty, hardware cost and the complexities of these algorithms.

21 pages, 11 figures and 6 tables

References in corpus (2)

• Theory and Applications of Two-dimensional, Null-boundary, Nine-Neighborhood, Cellular Automata Linear rules
• Characterization Of any Non-linear Boolean function Using A Set of Linear Operators