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

Simple item page
dc.creatorNayak, Birendra Kumar
dc.creatorSahoo, Sudhakar
dc.creatorRout, Sushant Kumar
dc.date2008-02-25
dc.date.accessioned2026-07-07T09:23:30Z
dc.date.available2026-07-07T09:23:30Z
dc.descriptionTwo-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.
dc.description14 pages, presented at Orissa Mathematical Society Conference, 2008
dc.identifierhttps://arxiv.org/abs/0802.3626
dc.identifierhttp://arxiv.org/abs/0802.3626
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155754
dc.subjectLogic in Computer Science
dc.titleColor Graphs: An Efficient Model For Two-Dimensional Cellular Automata Linear Rules
dc.typetext

Files

Collections

arXiv