Issues on drawing the State Transition Diagram for arbitrary Cellular Automata
classification
🌊 nlin.CG
keywords
automatacellularalgorithmsarbitrarydiagramdrawingstatetransition
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.