Issues on drawing the State Transition Diagram for arbitrary Cellular Automata

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Cellular Automata and Lattice Gases

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/173788

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0811.1513
 http://arxiv.org/abs/0811.1513

Collections

arXiv