Color Graphs: An Efficient Model For Two-Dimensional Cellular Automata Linear Rules

2008/02/25 by Birendra Kumar Nayak, Nayak, Birendra Kumar, Sudhakar Sahoo +3
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.LO

paper · pdf · doi:10.48550/arxiv.0802.3626

14 pages, presented at Orissa Mathematical Society Conference, 2008

arxiv created 2008/02/25 · arxiv updated 2009/12/01

Abstract

Two-dimensional nine neighbor hood rectangular Cellular Automata rules can be modeled using many different techniques like Rule matrices, State Transition Diagrams, Boolean functions, Algebraic Normal Form etc. In this paper, a new model is introduced using color graphs to model all the 512 linear rules. The graph theoretic properties therefore studied in this paper simplifies the analysis of all linear rules in comparison with other ways of its study.

Related

• Issues on drawing the State Transition Diagram for arbitrary Cellular Automata
• A New Parameter F to Classify Cellular Automata Rule Table Space and a Phase Diagram in λ-F Plane
• Classification of Cellular Automata Rules Based on Their Properties
• Cellular Automata Rules and Linear Numbers
• The GraftalLace Cellular Automaton