Linear cellular automata, finite automata and Pascal's triangle

Discrete Applied Mathematics

Volumn 66, Issue 1, 1996, Pages 1-22

  Allouche, J P ^a   Von Haeseler, F ^b   Peitgen, H O ^b   Skordev, G ^b  

^a CNRS   (France)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001892863     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(94)00132-W     Document Type: Article

References (35)

1. J.-P. Allouche, Automates finis en théorie des nombres, Expo. Math. 5 (1986) 239-266.
2. J.-P. Allouche, Finite automata in 1-dimensional and 2-dimensional physics, in: J.-M. Luck, P. Moussa and M. Waldschmidt, eds., Number Theory and Physics, Proceedings in Physics, Vol. 47 (Springer, Berlin, 1990) 177-184.
3. J.-P. Allouche and J. Shallit, The ring of k-regular sequences, Theoret. Comput. Sci. 98 (1992) 163-197.
4. J. Berstel and M. Morcrette, Compact representation of patterns by finite automata, Proc. Pixim '89 (Hermes, 1989) 387-402.
5. J. Berstel and A. Nait Abdallah, Tétrarbres engendrés par des automates finis, Publications du LITP 89-7 (1989) and: Bigre + Globule 61-62 (1989) 167-175.
6. J. Berstel and A. Nait Abdallah, Tétrarbres engendrés par des automates finis, Publications du LITP 89-7 (1989) and: Bigre + Globule 61-62 (1989) 167-175.
7. B. Bondarenko, Generalized Triangles and Pyramids of Pascal, Their Fractals, Graphs and Applications (Fan, Tashkent, 1990) (in Russian).
8. G. Christol, T. Kamae, M. Mendès France and G. Rauzy, Suites algébriques, automates et substitutions, Bull. Soc. Math. France 108 (1980) 401-419.
9. A. Cobham, On the base-dependence of sets of numbers recognizable by finite automata, Math. Systems Theory 3 (1969) 186-192.
10. A. Cobham, Uniform tag sequences, Math. Systems Theory 6 (1972) 164-192.
11. K. Culik II and S. Dube, Fractal and recurrent behavior of cellular automata, Complex Systems 3 (1989) 253-267.
12. J. Denef and L. Lipschitz, Algebraic power series and diagonals, J. Number Theory 26 (1987) 46-67.
13. S. Eilenberg, Automata, Languages and Machines, Vol. A (Academic Press, New York, 1985).
14. H. Furstenberg, Algebraic functions over finite fields, J. Algebra 7 (1967) 271-277.
15. F. von Haeseler, H.-O. Peitgen and G. Skordev, Pascal's triangle, dynamical systems and attractors, Ergodic Theory Dynamical Systems 12 (1992) 479-486.
16. F. von Haeseler, H.-O. Peitgen and G. Skordev, Linear cellular automata, substitutions, hierarchical iterated systems, in: J.L. Encarnasao et al., eds., Fractal Geometry and Computer Graphics (Springer, Berlin, 1992).
17. F. von Haeseler, H.-O. Peitgen and G. Skordev, On the fractal structure of rescaled evolution sets of cellular automata and attractors of dynamical systems, Report 278, Inst. Dyn. Syst., University of Bremen (1992).
18. F. von Haeseler, H.-O. Peitgen and G. Skordev, Cellular automata, matrix substitutions and fractals, Ann. Math. Art. Intel. 8 (1993) 345-362.
19. J. Holte, The dimension of the set of multinomial coefficients not divisible by n, AMS Annual Meeting (1991).
20. E. Kummer, Über die Ergänzungssätze zu den allgemeinen Reciprocitätsgesetzen, J. Reine Angew. Math. 44 (1852) 93-146.
21. B. Litow and P. Dumas, Additive cellular automata and algebraic series, Theoret. Comput. Sci. 119 (1993) 345-354.
22. E. Lucas, Sur les congruences des nombres eulériens et des coefficients différentiels des fonctions trigonométriques, Bull. Soc. Math. France 6 (1878) 49-54.
23. H.-O. Peitgen, H. Jürgens and D. Saupe, Chaos and Fractals (Springer, Berlin, 1992).
24. A.D. Robinson, Fast computation of additive cellular automata, Complex Systems 1 (1987) 211-216.
25. O. Salon, Suites automatiques à multi-indices et algébraicité, C.R. Acad. Sci. Paris 305 (Sér. I) (1987) 501-504.
26. O. Salon, Suites automatiques à multi-indices, Séminaire de Théorie des Nombres de Bordeaux, Exposé 4 (1986-1987) 4-01-4-27, followed by an appendix by J. Shallit, 4-29A-4-36A.
27. J. Shallit and J. Stolfi, Two methods for generating fractals, Comput. Graphics 13 (1989) 185-191.
28. R. Stanley, Enumerative Combinatorics, I (Wadsworth and Brooks/Cole, Advanced Books and Software, Monterey, CA, 1986).
29. M. Sved and J. Pitman, Divisibility of binomials by prime powers, a geometrical approach, Ars Combin. 26 (1988) 197-222.
30. S. Takahashi, Self-similarity of linear cellular automata, J. Comput. Sci. 44 (1992) 14-140.
31. H.S. Wilf, An aperiodic sequence, Problem E 3457, solution by J.R. Griggs, Amer. Math. Monthly 100 (1993) 502-503.
32. S. Willson, Cellular automata can generate fractals, Discrete Appl. Math. 8 (1984) 91-99.
33. S. Willson, A use of cellular automata to obtain families of fractals, in: M. Barnsley and S. Demko, eds., Chaotic Dynamics and Fractals (Academic Press, New York, 1986).
34. S. Willson, Calculating growth rates and moments for additive cellular automata, Discrete Appl. Math. 35 (1992) 47-65.
35. S. Wolfram, Theory and Application of Cellular Automata (World Scientific, Singapore, 1986).