Issues on drawing the State Transition Diagram for arbitrary Cellular Automata

Simple item page
dc.creatorSahoo, Sudhakar
dc.creatorChoudhury, Pabitra Pal
dc.date2008-11-10
dc.date.accessioned2026-07-07T10:17:15Z
dc.date.available2026-07-07T10:17:15Z
dc.descriptionThis 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.
dc.description21 pages, 11 figures and 6 tables
dc.identifierhttps://arxiv.org/abs/0811.1513
dc.identifierhttp://arxiv.org/abs/0811.1513
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173788
dc.subjectCellular Automata and Lattice Gases
dc.titleIssues on drawing the State Transition Diagram for arbitrary Cellular Automata
dc.typetext

Files

Collections

arXiv