Orbits in one-dimensional finite linear cellular automata.

@article{Tadaki1994OrbitsIO,
  title={Orbits in one-dimensional finite linear cellular automata.},
  author={Tadaki},
  journal={Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics},
  year={1994},
  volume={49 2},
  pages={
          1168-1173
        }
}
  • Tadaki
  • Published 14 May 1993
  • Physics
  • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
Periodicity and relaxation are investigated for the trajectories of the states in one-dimensional finite cellular automata with rules 90 and 150 [S. Wolfram, Rev. Mod. Phys. 55, 601 (1983)]. The time evolutions are described with matrices. An eigenvalue analysis is applied to clarify the maximum value of period and relaxation. 
View on PubMed
arxiv.org
2 Citations

Tables from this paper

2 Citations

Citation Type

Citation Type

Instability control in two dimensional traffic flow model
Additive Cellular Automata
  • B. Voorhees
  • Computer Science
    Encyclopedia of Complexity and Systems Science
  • 2009
TLDR
The rule, or update rule, of a cellular automaton describes how any given state is transformed into its successor state, and a rule table, which defines a local neighborhood mapping, or equivalently as a global update mapping, is described.

References

SHOWING 1-10 OF 24 REFERENCES
Theory Of Self Reproducing Automata
A Course in Number Theory and Cryptography
Commun
  • Math. Phys. 93, 219
  • 1984
Nature Phys. Rev. Lett
  • Nature Phys. Rev. Lett
  • 1984
Rev. Mod. Phys
  • Rev. Mod. Phys
  • 1983
Prog
  • Theor. Phys. 89, no. 2
  • 1993
Gutowitz ed., Cellular Automata
  • 1991
Physica 45D
  • 26
  • 1990
IEEE Trans. CAD IBM J Res. Develop. IEEE Trans. Comput
  • IEEE Trans. CAD IBM J Res. Develop. IEEE Trans. Comput
  • 1989
Commun
  • Math. Phys. 118, 569
  • 1988
...
1
2
3
...