Issues on drawing the State Transition Diagram for arbitrary Cellular Automata

2008/11/10 by Sudhakar Sahoo, Sahoo, Sudhakar, Pabitra Pal Choudhury +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Physics and Astronomy · #Advanced Data Storage Technologies #Cellular Automata and Applications #Cellular Automata and Lattice Gases (nlin.CG) #DNA and Biological Computing #FOS: Physical sciences #nlin.CG

paper · pdf · doi:10.48550/arxiv.0811.1513

21 pages, 11 figures and 6 tables

arxiv created 2008/11/10 · openalex publication_date 2008/11/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Theory and Applications of Two-dimensional, Null-boundary, Nine-Neighborhood, Cellular Automata Linear rules

Related

• Classification of Cellular Automata Rules Based on Their Properties
• Characterization of Maximal Length Cellular Automata Using NSRTD
• Color Graphs: An Efficient Model For Two-Dimensional Cellular Automata Linear Rules
• Discrete Baker Transformation and Cellular Automata
• Investigation of Rule 73 as Case Study of Class 4 Long-Distance Cellular Automata