This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Some Dynamical Properties of Finite Cellular Automaton
January 1978 (vol. 27 no. 1)
pp. 42-52
M. Harao, Research Institute of Electrical Communication, Tohoku University
Some characteristics of the global function of the finite cellular automaton (FCA) are investigated. First, a necessary and sufficient condition for a function from the configuration set to itself to be realized by means of an FCA is given. Next, using these results, the realizability of cycle and tree type transition structures is discussed. Especially, for the system of binary 3-neighbor FCA, the realizability of the maximal cycle length and the bijectivity of the global function are investigated. For the system of FCA, each passive configuration set is defined. An algorithm to obtain the spectrum of a passive configuration set is also discussed. In addition, some examples on the spectrum for the system of binary 3-neighbor FCA are demonstrated.
Index Terms:
tree type transition, Abelian group graph, cellular automaton, characteristic polynomial, cycle type transition, homogeneous nets, passive configuration, spectrum
Citation:
M. Harao, S. Noguchi, "On Some Dynamical Properties of Finite Cellular Automaton," IEEE Transactions on Computers, vol. 27, no. 1, pp. 42-52, Jan. 1978, doi:10.1109/TC.1978.1674951
Usage of this product signifies your acceptance of the Terms of Use.