On Some Dynamical Properties of Finite Cellular Automaton
- 1 January 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-27 (1), 42-52
- https://doi.org/10.1109/tc.1978.1674951
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- On Some Dynamical Properties of Finite Cellular AutomatonIEEE Transactions on Computers, 1978
- Homogeneous nets of neuron-like elementsBiological Cybernetics, 1975
- On the interconnection structure of cellular networksInformation and Control, 1974
- Some regular state sets in the system of one-dimensional iterative automataInformation Sciences, 1973
- Structural and behavioral equivalences of tessellation automataInformation and Control, 1971
- On Connecting Modules Together Uniformly to Form a Modular ComputerIEEE Transactions on Electronic Computers, 1966