References

[1] Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55, 601 (1983).

[2] Golomb, S.W.: Shift register sequences. San Francisco: Holden-Day 1967.

[3] Selmer, E.S.: Linear recurrence relations over finite fields. Dept. of Math., Univ. of Bergen, Norway (1966).

[4] Miller, J.C.P.: Periodic forests of stunted trees. Phil. Trans. R. Soc. Lond. A266, 63 (1970); A293, 48 (1980).

[5] Moore, E.F.: Machine models of self-reproduction. Proc. Symp. Appl. Math. 14, 17 (1962) reprinted in: Essays on cellular automata, A. W. Burks. Univ. of Illinois Press (1966).

[6] Knuth, D.: Fundamental algorithms, Reading, MA: Addison-Wesley 1968.

[7] Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers. Oxford: Oxford University Press 1968.

[8] MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. Amsterdam: North-Holland 1977.

[9] Griffiths, P., Harris, J.: Principles of algebraic geometry. New York: Wiley 1978.

[10] Fredkin, E., Margolus, N.: Private communications.

[11] Ronse, C.: Non-linear shift registers: A survey. MBLE Research Lab. report, Brussels (May 1980).

[12] Harao, M. and Noguchi, S.: On some dynamical properties of finite cellular automaton. IEEE Trans. Comp. C-27, 42 (1978).

[13] Grassberger, P.: A new mechanism for deterministic diffusion. Phys. Rev. A (to be published).

[14] Guibas, L.J., Odlyzko, A.M.: String overlaps, pattern matching, and nontransitive games. J. Comb. Theory (A) 30, 83 (1981).

[15] Knuth, D.: Seminumerical algorithms. 2nd ed. Reading, MA: Addison-Wesley 1981.

[16] Odlyzko, A.M.: Unpublished.

[17] Lind, D.A.: Applications of ergodic theory and sofic systems to cellular automata. Physica D 10 (to be published).

[18] Wolfram, S.: Computation theory of cellular automata. Institute for Advanced Study preprint (January 1984).

[19] Lenstra, H.W., Jr.: Private communication.

previous  l  next