Issues on drawing the State Transition Diagram for arbitrary Cellular Automata
Cellular Automata and Lattice Gases
2008-11-11 v1
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.
Keywords
Cite
@article{arxiv.0811.1513,
title = {Issues on drawing the State Transition Diagram for arbitrary Cellular Automata},
author = {Sudhakar Sahoo and Pabitra Pal Choudhury},
journal= {arXiv preprint arXiv:0811.1513},
year = {2008}
}
Comments
21 pages, 11 figures and 6 tables