From: Subject: Cellular Automata FAQ - Bibliography Date: Sat, 9 Dec 2006 17:06:44 -0800 MIME-Version: 1.0 Content-Type: multipart/related; type="text/html"; boundary="----=_NextPart_000_0000_01C71BB4.6722DDF0" X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.2962 This is a multi-part message in MIME format. ------=_NextPart_000_0000_01C71BB4.6722DDF0 Content-Type: text/html; charset="Windows-1252" Content-Transfer-Encoding: quoted-printable Content-Location: http://cafaq.com/bibliography/index.php Cellular Automata FAQ - Bibliography

Cellular Automata FAQ

[Non-Java=20 version]=20

Bibliography

1=20: molecular and biomolecular computing. IEEE Computer, = 25(11), nov=20 1992.=20
2=20: molecular and biomolecular computing. IEEE Egineering in = Medicine and=20 Biology, feb-mar 1994.=20
3=20: Mark J Ablowitz, James M Keiser, and Leon A Takhtajan. Class of = stable=20 multistate time-reversible cellular automata with rich particle = content.=20 Physical Review A,Atomic, molecular, and opt, 44(10):6909, = 1991.=20
4=20: A. I Adamatskii. Complexity of identification of cellular = automata.=20 Automation and remote control, 53(9 p 2):1449, September = 1992.=20
5=20: A. I Adamatskii. Complexity of sequential realization of cellular = automata=20 maps. Automation and remote control, 55(2):271, February = 1994.=20
6=20: A. I Adamatskiy. Identification of probabilistic cellular = automata.=20 Soviet journal of computer and systems sciences, 30(3):118, = May 1992.=20
7=20: A. I Adamatskiy. Complexity of identifying asynchronous = nonstationary=20 cellular automata. Journal of Computer and Systems Science,=20 31(3):127, May 1993.=20
8=20: Andrew I. Adamatzkii. Identification of Fuzzy Cellular Automata.=20 Automatic Control and Computer Sciences, 25(6):72-76, 1991.=20
9=20: A. I Adamatzky. Hierarchy of fuzzy cellular automata. Fuzzy = sets and=20 systems, 62(2):167, 1994.=20
10=20: Andrew Adamatzky. Identification of Cellular Automata. = Taylor and=20 Francis, London, Bristol, 1994.=20
11=20: Andrew I Adamatzky. Implantation of cellular automata. Applied = Mathematics and Computation, 55(1):49, April 1993.=20
12=20: E. D. Adamides, Ph. Tsalides, and A. Thanailakis. Hierarchical = cellular=20 automata structures. Parallel Computing, 18(5):517-524, May = 1992.=20
13=20: Roy Adler and Leopold Flatto. Geodesic flows, interval maps, and = symbolic=20 dynamics. Bulletin of the American Mathematical Society, = 25:229-334,=20 1991.=20
14=20: V. S Afraimovich and M. A Shereshevskii. Topological dynamics of = cellular=20 automata. Selecta mathematica Sovietica, 11(4):355, 1992.=20
15=20: Zvia Agur. Fixed points of majority rule cellular automata with=20 application to plasticity and precision of the immune system. = Complex=20 Systems, 5(3):351-357, June 1991.=20
16=20: Philipe Aigrain and Dani=E8le Beauquier. Polyomino tilings, = cellular=20 automata and codicity. Theoretical Computer Science,=20 147(1-2):165-180, 1995.=20
17=20: V. Aladyev, A. Krasnoproshina, and V. Kryschanovskii. Unsolved = theoretical=20 problems in homogeneous structures. In G. Wolf, T. Legendi, and U. = Schendel,=20 editors, Proceedings of the 4th International Workshop on Parallel = Processing by Cellular Automata and Arrays, pages 33-50. LNCS = 342.=20 Springer, October 1988.=20
18=20: J. Albert and K. Culik II. A simple universal cellular automaton = and its=20 one-way and totalistic version. Complex Systems, 1:1-16, = 1987.=20
19=20: A. Albrecht. On simultaneous realizations of boolean functions, = with=20 applications. In G. Wolf, T. Legendi, and U. Schendel, editors, = Proc. 4th=20 Intl. Workshop on Parallel Proc. by CA and Arrays, pages 51-56. = LNCS 342.=20 Springer, October 1988.=20
20=20: T. V Alekseyevskaya and A. G Malenkov. Mathematical model of the=20 initiation of near weekly fluctuations in tissue (cellular automata).=20 Biophysics, 36(2):356, 1991.=20
21=20: Zoran Aleksic. Computation in inhomogenous celluar automata. In = David=20 Green and Terry Bossomaier, editors, Complex Systems: From Biology = to=20 Computation. IOS Press, Amsterdam, 1993. anonymous ftp = life.anu.edu.au:=20 /pub/complex_systems/anu92/papers/aleksic.ps.=20
22=20: N. M Allinson and M. J Sales. CART - A cellular automata research = tool.=20 Microprocessors and microsystems, 16(8):4093, 1992. The = authors=20 discuss the principles of cellular automata and present a detailed = design of=20 an expandable machine together with an example maze-solving program.=20
23=20: P. Alstrom and J. Leao. Self-organized criticality in the 'game of = life'.=20 Physical Review E, 49(4), April 1994.=20
24=20: A. S. Alves. Discrete Models of Fluid Dynamics. World = Scientific,=20 1991.=20
25=20: S. Amoroso and Y. N. Patt. Decision procedures for surjectivity = and=20 injectivity of parallel maps for tesselation structures. Journal = of=20 Computer and Systems Sciences, 6:448-464, 1972.=20
26=20: R. Anderson and K. Bunas. Grain size segregation and stratigraphy = in=20 aeolian ripples modelled with a cellular automaton. Nature,=20 365:740-743, October 1993.=20
27=20: I.L Anshel and Michael Anshel. From the post-markov theorem = through=20 decision problems to public-key cryptography. The American = Mathematical=20 Monthly, 100:835-844, 1993.=20
28=20: K. Aoki and N. Mugibayashi. Cellular automata and coupled chaos = developed=20 in a lattice chain of N equivalent switching elements. Physics = Letters=20 A, 114:425, 1988.=20
29=20: R. C. Backhouse and B. A. Carr=E9. Regular algebra applied to = path-finding=20 problems. Journal of the Institute for Mathematics and its=20 Applications, 15:161-186, 1975.=20
30=20: F Bagnoli, R Rechtman, and S Ruffo. Damage spreading and lyapunov=20 exponents in cellular automata. Physics Letters A, 172(1 / = 2):34,=20 1992.=20
31=20: Franco Bagnoli, Raul Rechtman, and Stefano Ruffo. General = algorithm for=20 two-dimensional totalistic cellular automata. Journal of = Computational=20 Physics, 101(1):176, July 1992.=20
32=20: Bak, Chen, and Creutz. Soc/game of life (??). Nature, = 342:780,=20 1989.=20
33=20: Robert Balzer. An 8-state minimal time solution to the firing = squad=20 synchronization problem. Information and Control, 10:22-42, = 1967.=20
34=20: O. L. Bandman and S. V. Piskunov. Parallel microprogramming as a = tool for=20 multi-microprocessor systems. In G. Wolf, T. Legendi, and U. Schendel, = editors, Proceedings of the 4th International Workshop on Parallel = Processing by Cellular Automata and Arrays, pages 57-72. LNCS = 342.=20 Springer, October 1988.=20
35=20: E. R. Banks. Universality in cellular automata. In Proc. 11th = IEEE=20 Symposium on Foundations of Computer Science (FOCS), pages = 194-215, 1970.=20
36=20: E. R. Banks. Information processing and transmission in cellular = automata.=20 Technical Report MIT/LCS/TR-81, MIT Laboratory for Computer Science, = January=20 1971. Price: $6.35.=20
37=20: Edwin Roger Banks. Cellular automata. Technical Report AI Memo = 198,=20 Artificial Intelligence Laboratory, Massachusetts Institute of = Technology=20 (MIT), Cambridge, Massachusetts, June 1970.=20
38=20: Edwin Roger Banks. Universality in cellular automata. In = Conference=20 Record of 1970 Eleventh Annual Symposium on Switching and Automata=20 Theory, pages 194-215, Santa Monica, California, 1970. IEEE.=20
39=20: Sergei N. Baranoff. Cellular automata on a personal computer. In=20 euroForth '92 Conference Proceedings, pages 79-80, MPE Ltd., = 133 Hill=20 Lane, Southampton. SO1 5AF UK, October 1992. Forth Interest Group.=20
40=20: A. M. Barbe. A CA ruled by an eccentric conservation law. = Physica=20 D, 45:49, 1990.=20
41=20: D Barca, G. M Crisci, and S Di Gregorio. Cellular automata for = simulating=20 lava flows: A method and examples of the etnean eruptions. = Transport=20 theory and statistical physics, 23(1 / 3):195, 1994.=20
42=20: Michael P. Barnett. Primitive string transformations as reductions = to=20 normal form. SIGPLAN Notices, 25(5):29-33, May 1990.=20
43=20: Michael P. Barnett and Xu Rui. Infix to previx conversion as a PST = reduction. SIGPLAN Notices, 25(5):34-38, May 1990.=20
44=20: B Barral, H Chate, and P Manneville. Collective behaviors in a = family of=20 high-dimensional cellular automata. Physics Letters A, = 163(4):279,=20 1992.=20
45=20: Benoit Barriere and Donald L Turcotte. A scale invariant cellular = automata=20 model for distributed seismicity. Geophysical research = Letters,=20 18(11):2011, November 1991.=20
46=20: Bartlett and Garzon. Distribution of linear rules in cellular = automata=20 rule space. Complex Systems, 6, 1992.=20
47=20: A. G. Barto. Cellular automata as models of natural systems. = Technical=20 report, Michigan, 1975.=20
48=20: Rana Barua and S. Ramakrishnan. -game, -game and two-dimensional additive cellular = automata.=20 Theoretical Computer Science, 154(2):349-366, 1996. = Mathematical=20 Games.=20
49=20: Michael Batty and Paul Longley. Fractal Cities. Academic = Press,=20 1994. ISBN 0-12-455570-5.=20
50=20: G. W Baxter and R. P Behringer. Cellular automata models for the = flow of=20 granular materials. Physica D, 51(1 / 3):465, August 1991.=20
51=20: Coskun Bayrak, Ali H. Dogru, and Sukumarn V. S. Nair. The = annotated=20 bibliography on cellular automata. Technical Report 90-CSE-30, = Southern=20 Methodist University, 1990. price ($1.00).=20
52=20: Carter Bays. The game of three dimensional life. Technical report, = 1986.=20 available as a supplement to A. K. Dewdney's February 1987 column.=20
53=20: Carter Bays. Candidates for the game of life in three dimensions.=20 Complex Systems, 1(2):373-400, April 1987.=20
54=20: Carter Bays. Classification of semitotalistic cellular automata in = three=20 dimensions. Complex Systems, 2:235-254, 1987.=20
55=20: Carter Bays. A note on the discovery of a new game of = three-dimensional=20 life. Complex Systems, 2:255-258, 1987.=20
56=20: Carter Bays. Patterns for simple cellular automata in a universe = of dense=20 packed spheres. Complex Systems, 1(6):853-875, December 1987. =
57=20: Carter Bays. Classification of semitotalistic cellular automata in = three=20 dimensions. Complex Systems, 2(2):235-254, April 1988.=20
58=20: Carter Bays. The discovery of a new glider in the game of=20 three-dimensional life. Complex Systems, 4(6):599-602, = December 1990.=20
59=20: Carter Bays. A new game of three-dimensional life. Complex=20 Systems, 5(1):15-18, February 1991.=20
60=20: Carter Bays. 3D life (?). Complex Systems, 6(5):433-442, = 1992.=20
61=20: Carter Bays. A new candidate rule for the game of = three-dimensional life.=20 Complex Systems, 6:433-441, 1992.=20
62=20: V. Beiu. VLSI arrays implementing parallel line-drawing = algorithms. In G.=20 Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th = International Workshop on Parallel Processing by Cellular Automata and = Arrays, pages 241-247. LNCS 342. Springer, October 1988.=20
63=20: Bennett and Bourzutschy. Nature, 350:468, 1991.=20
64=20: C. H. Bennett, T. Toffoli, and S. Wolfram. Cellular automata '86=20 conference. Technical Report MIT/LCS/TM-317, MIT Laboratory for = Computer=20 Science, December 1986. Price: $6.00.=20
65=20: S. A Berezner, M Krutina, and V. A Malyshev. Exponential = convergence of=20 toom's probabilistic cellular automata. Journal of Statistical=20 Physics, 73(5 / 6):927, December 1993.=20
66=20: R. Berger. The undecidability of the domino problem. Memoirs = of the=20 American Mathematical Society, 66, 1966.=20
67=20: Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy. = Winning Ways=20 for your Mathematical Plays, volume 2. Academic Press, ISBN=20 0-12-091152-3, 1982. chapter 25.=20
68=20: Piotr Berman and Janos Simon. Investigations of fault-tolerant = networks of=20 computers. In Proc. of the 20-th Annual ACM Symp. on the Theory of = Computing, pages 66-77, 1988.=20
69=20: H. Bersini and V. Detours. Asynchrony induces stability in = cellular=20 automata based models. In Brooks, R. A, Maes, and Pattie, editors,=20 Proceedings of the 4th International Workshop on the Synthesis and = Simulation of Living Systems , pages = 382-387.=20 MIT Press, July 1994.=20
70=20: S. C Bhargava, Arun Kumar, and A Mukherjee. A stochastic cellular = automata=20 model of innovation diffusion. Technological forecasting and = social=20 change, 44(1):87, August 1993.=20
71=20: M. Biafore. Few-body cellular automata. Technical Report = MIT/LCS/TR-597,=20 MIT Laboratory for Computer Science, December 1993. Price: $13.75.=20
72=20: M Biafore. Cellular automata for nanometer-scale computation. = Physica=20 D, 70(4):415, 1994.=20
73=20: Iwo Bialynicki-Birula. Weyl, dirac, and maxwell equations on a = lattice as=20 unitary cellular automata. Physical Review, 49(12):6920, = 1994.=20
74=20: Roger Bidaux, Nino Boccara, and Hugues Chate. Order of the = transition=20 versus space dimension in a family of cellular automata. Physical = Review=20 A, 39(6):3094-3105, 1989.=20
75=20: P. M. Binder. Topological classification of cellular automata. = Journal=20 of Physics A 24, pages L31-5, 1991.=20
76=20: P.-M. Binder. unknown. J. Phys. A, 24(L21), 1991.=20
77=20: P.-M. Binder. Parametric ordering of complex systems. Physical = Review=20 E, 1993.=20
78=20: P. M. Binder. A phase diagram for elementary cellular automata.=20 Complex Systems, 7:241-7, 1993.=20
79=20: P. M. Binder. (anti),table points and the dynamics of extended = systems.=20 Physics Letters 187A, pages 167-70, 1994.=20
80=20: P. M. Binder. Parametric ordering of complex systems. Physical = Review=20 E 49, pages 2023-5, 1994.=20
81=20: P. M. Binder. Domains and synchronization in high-dimensional = cellular=20 automata. Physical Review E 51, pages R839-40, 1995.=20
82=20: P.-M Binder, B Buck, and V. A Macaulay. Time-series analysis of a=20 collective variable in high-dimensional cellular automata. Journal = of=20 Statistical Physics, 68(5 / 6):1127, September 1992.=20
83=20: P. M Binder, D. Y. K Ko, and A. L Owczarek. Ordered cellular = automata in=20 one dimension. Journal de physique, 3(1):21, January 1993.=20
84=20: P. M. Binder and V. Privman. Second-order dynamics in the = collective=20 temporal evolution of complex systems. Physical Review = Letters,=20 68:3830-3, 1992.=20
85=20: Philippe Binder, Carole Twining, and David Sherrington. = Phase-space study=20 of bistable cellular automata. Complex Systems, 5(2):127-138, = April=20 1991.=20
86=20: George D. Birkhoff. Dynamical Systems. American = Mathematical=20 Society, Providence, Rhode Island, 1927.=20
87=20: Ph Blanchard and D Gandolfo. Cellular automata approach to site=20 percolation on Z2. A numerical study. Journal of Statistical = Physics,=20 73(1 / 2):399, October 1993.=20
88=20: A Bobenko, M Bordemann, and C Gunn. On two integrable cellular = automata.=20 Communications in Mathematical Physics, 158(1):127, 1993.=20
89=20: N. Boccara, E. Goles, S. Martinez, and P. Picco. Cellular = Automata and=20 Cooperative Phenomena. Kluwer Academic Publishers, 1993.=20
90=20: N. Boccara, J. Nasser, and M. Roger. Annihilation of defects = during the=20 evolution of some one-dimensional class-3 deterministic cellular = automata.=20 Europhysics Letters, 13(6):489, 1990.=20
91=20: N. Boccara, J. Nasser, and M. Roger. Particle-like structures and=20 interactions in spatio-temporal patterns generated by one-dimensional=20 determinsitic cellular automaton rules. Physical Review A, = 44, July=20 1991.=20
92=20: R. J. De Boer and P. Hogeweg. Growth and recruitment in the immune = network. In A. F. Perelson and G. Weisbuch, editors, Theoretical = and=20 Experimental Insights into Immunology, volume 66, pages 223-247. = Springer=20 Verlag, New York, 1992.=20
93=20: B. M. Boghosian. Cellular automata simulation of two-phase flow on = the=20 CM-2 connection machine computer. Technical Report TR-19 CA88-1, = Thinking=20 Machines Corporation, 1988. (Appeared in Supercomputing 88, Vol. = II:Science=20 and Applications, J. L. Martin and S. F.Lundstrom, eds.: IEEE Computer = Society=20 Press [1989]: pp. 34-44.).=20
94=20: B. M. Boghosian. Deterministic cellular automata with diffusive = behavior.=20 Technical Report TR-15 CA90-1, Thinking Machines Corporation, 1989. = (Appeared=20 in Cellular Automata and Modeling of Complex Physical Systems, P. = Manneville,=20 N. Boccara, G. Y.Vichniac, and R. Bidaux, eds. Berlin: = Springer-Verlag[1989]:=20 pp. 118-129.).=20
95=20: Bruce M Boghosian. Lattice gases illustrate the power of cellular = automata=20 in physics. Computers in Physics, 5(6):585, November 1991.=20
96=20: Jean Pierre Boon. Lattice gas automata: Theory, simulation,=20 implementation. Journal of Statistical Physics, 68(3/4), = 1992.=20
97=20: K. Bouazza, J. Champeau, P. Ng, B. Pottier, and S. Rubini. = Experimental=20 cellular automata on the ArMen machine. In P. Quinton and Y. Robert, = editors,=20 Proceedings of the Workshop on Algorithms and Parallel VLSI = Architectures=20 II, pages 317-322, Bonas, France, June 1991. Elsevier Science = Publishers=20 B.V.=20
98=20: S. Boubezari and B. Kaminska. Cellular automata synthesis based on = pre-computed test vectors for built-in self-test. In M. Lightner, = editor,=20 Proceedings of the IEEE/ACM International Conference on = Computer-Aided=20 Design, pages 578-585. IEEE Computer Society Press, November = 1993.=20
99=20: G. Braga, G. Cattaneo, P. Flocchini, and C. Quaranta Vogliotti. = Pattern=20 growth in elementary cellular automata. Theoretical Computer = Science,=20 145(1-2):1-26, 1995. Fundamental Study.=20
100=20: Maury Bramson and Claudia Neuhauser. Survival of one-dimensional = cellular=20 automata under random perturbations. The annals of = probability,=20 22(1):244, January 1994.=20
101=20: A Brass, R. K Grencis, and K. J Else. A cellular automata model = for helper=20 T cell subset polarization in chronic and acute infection. Journal = of=20 theoretical biology, 166(2):189, 1994.=20
102=20: X. Breckling. unknown. Ecological Modeling, = 63(13-27):13-27,=20 1993.=20
103=20: L Brieger and E Bonomi. Cellular automata-lattice gas models for = PDE's.=20 Computer Physics Communications, 73(1 / 3):47, December 1992. =
104=20: John Briggs and F. David Peat. An Illustrated Guide to Chaos = Theory=20 and the Science of Wholeness. Harper & Row, New York, 1989.=20
105=20: R Brito and M. H Ernst. Propagating staggered waves in cellular = automata=20 fluids. Journal of Physics A, 24(14):3331, 1991.=20
106=20: R. Brito, M. H. Ernst, and T. R. Kirkpatrick. Staggered = diffusivities in=20 lattice gas cellular automata. Journal of Statistical = Physics, 62(1 /=20 2):283, 1991.=20
107=20: A Broggi, V d'Andrea, and G Destri. Cellular automata as a = computational=20 model for low-level vision. International Journal of modern = physics=20 C, 4(1):5, February 1993.=20
108=20: Brown. Competition of cellular automata rules. Complex = Systems,=20 1, 1987.=20
109=20: M Bruschi and P. M Santini. Cellular automata in 1+1, 2+1 and 3+1=20 dimensions, constants of motion and coherent structures. Physica = D,=20 70(1 / 2):185, January 1994.=20
110=20: M Bruschi, P. M Santini, and O Ragnisco. Integrable cellular = automata.=20 Physics Letters A, 169(3):151, 1992.=20
111=20: L Le Bruyn and M Van Den Bergh. Algebraic properties of linear = cellular=20 automata. Linear algebra and its applications, 157:217, = November=20 1991.=20
112=20: Janusz A. Brzozowski. Derivatives of regular expressions. = Journal of=20 the Association for Computing Machinery, 11:481-494, 1964.=20
113=20: David J. Buckingham. Some facts of life. Byte, 3(12): = 54-67,=20 December 1978.=20
114=20: L. A Bunimovich and S. E Troubetzkoy. Recurrence properties of = lorentz=20 lattice gas cellular automata. Journal of Statistical = Physics, 67(1 /=20 2):289, April 1992.=20
115=20: L. A Bunimovich and S. E Troubetzkoy. Rotators, periodicity, and = absence=20 of diffusion in cyclic cellular automata. Journal of Statistical=20 Physics, 74(1 / 2):1, January 1994.=20
116=20: Burks. Programming and the theory of automata. In Essays on = Cellular=20 Automata, ed. Arthur W. Burks, University of Illinois Press, Urbana, = Chicago,=20 London. 1970.=20
117=20: Burks. Von neumann's self-reproducing automata. In Essays on = Cellular=20 Automata, ed. Arthur W. Burks, University of Illinois Press, Urbana, = Chicago,=20 London. 1970.=20
118=20: A. W. Burks. Essays on Cellular Automata. University of = Illinois=20 Press, Urbana, 1970.
A classic collection of papers on cellular = automata intended as a companion to von Neumann's Theory of Self=20 Reproducing Automata [].=20 Includes papers by Burks, Thatcher, Moore, Myhill, Ulam, and = Holland.=20
119=20: A. W. Burks. Cellular automata and natural systems. In W. D. = Keidel, W.=20 H=E4ndler, and M. Spreng, editors, Cybernetics and Bionics, = pages=20 190-204, Munich, 1974. R. Oldenbourg.
Cellular Automata as a = useful=20 bridge between natural systems and formal computational systems.=20
120=20: Arthur W. Burks. Essays on Cellular Automata. University = of=20 Illinois Press, Urbana, IL, USA, 1970. A classic collection of papers = on=20 cellular automata intended as a companion to von Neumann's Theory = of Self=20 Reproducing Automata [].=20 Includes papers by Burks, Thatcher, Moore, Myhill, Ulam, and Holland.=20
121=20: Butler. A note on cellular automata simulations. Information = and=20 Computation (formerly Information and Control), 26, 1974.=20
122=20: J. T. Butler. Analysis of cellular automata growth models. In=20 Proceedings of 1978 ACM Computer Science Conference, Detroit = Michigan,=20 Feb. 1978, New York, 1978. Association for Computing Machinery.=20
.=20
123=20: Jon T. Butler. Synthesis of one-dimensional binary cellular = automata=20 systems from composite local maps. Information and Control,=20 43(3):304-326, December 1979.=20
124=20: E. Caianello and M. Marinaro. Linearization and synthesis of = cellular=20 automata. the additive case. Physica Scripta, 34:444, 1986.=20
125=20: E. R. Caianiello and M. Marinaro. Neural nets and cellular = automata. In I.=20 E. J. D. Becker, editor, Proceedings of a Workshop on Parallel = Processing=20 : Logic, Organization and Technology (WOPPLOT 86), pages 198-205. = LNCS=20 253. Springer, July 1986.=20
126=20: M. Cannataro, S. Di Gregorio, R. Rongo, W. Spataro, G. Spezzano, = and D.=20 Talia. Parallel cellular automata environment on multicomputers for = modeling=20 and simulation. Parallel Computing, submitted. ftp from = crai.it:=20 /pub/TR/talia bin/CAMEL.ps.Z.=20
127=20: A. Canning and E. Droz. A comparison of spin exchange and CA = models for=20 diffusion-controlled reactions. Physica D, 45:285, 1990.=20
128=20: H. C. Card, A. Thanailakis, W. Pries, and R. D. McLeod. Analysis = of=20 bounded linear cellular automata based on a method of image charges.=20 Journal of Computer and System Sciences, 33:473-480, 1986.=20
129=20: J. M. Carrera, E. J. Martinez, S. A. Fernandez, and J. M. Chaus.=20 Architecture of a FPGA-based coprocessor: The PAR-1. In D. A. Buell = and K. L.=20 Pocek, editors, Proceedings of IEEE Workshop on FPGAs for Custom = Computing=20 Machines, pages 20-29, Napa, CA, April 1995.=20
130=20: K. Cattell and M. Serra. The analysis of one dimensional = multiple-valued=20 linear cellular automata. In G. Epstein, editor, Proceedings of = the 20th=20 International Symposium on Multiple-Valued Logic, pages 402-409. = IEEE=20 Computer Society Press, May 1990.=20
131=20: F. Celada and P. E. Seiden. A computer model of cellular = interactions in=20 the immune system. Immun-t, 13:56-62, 1992.=20
132=20: A. Cerny. Generating words by cellular automata. In A. Tarlecki, = editor,=20 Proceedings of Mathematical Foundations of Computer Science. (MFCS = '91), pages 113-120. LNCS 520. Springer, September 1991.=20
133=20: J. Champeau, L. Le Pape, B. Pottier, S. Rubini, E. Gautrin, and L. = Perraudeau. Flexible parallel FPGA-based architectures with armen. In = T. N.=20 Mudge and B. D. Shriver, editors, Proceedings of the Twenty = Seventh Hawaii=20 Internation Conference on Systems Science, pages 105-13, Wailea, = HI,=20 1994. IEEE Comput. Soc. Press.=20
134=20: H. Chate and P. Maneville. Evidence of collective behavior in = cellular=20 automata. Europhysics Letters, 14:409-413, 1991.=20
135=20: H. Chate and P. Manneville. Criticality in CA. Physica D, = 45:122,=20 1990.=20
136=20: H. Chat=E9 and P. Manneville. Collective behaviors in spatially = extended=20 systems with local interactions and synchronous updating. Progress = of=20 Theoretical Physics, 87:1-60, 1992.=20
137=20: H. Chat=E9 and P Manneville. Emergence of effective = low-dimensional dynamics=20 in the macroscopic behaviour of coupled map lattices. Europhysics=20 Letters, 17:291-296, 1992.=20
138=20: Hugues Chat=E9 and Paul Manneville. Coupled map lattices as = cellular=20 automata. Journal of Statistical Physics, 56:357-370, 1989.=20
139=20: H. F Chau and K. S Cheng. Does spatial scaling imply temporal = scaling in=20 sandpile type cellular automata? Physics Letters A, = 170(3):195, 1992.=20
140=20: K. Cheung, L. Atlas, and R. Marks II. Synchronous vs asynchronous = behavior=20 of hopfield's CAM neural net. Appl. Optics, 26:4808-13, 1987. =
141=20: Choffrut and Culik. On real-time cellular automata and trellis = automata.=20 Acta Informatica, 21, 1984.=20
142=20: C. Choffrut and K. Culik II. On real-time cellular automata and = trellis=20 automata. Acta Informatica, 21:393-407, 1984.=20
143=20: Christian Choffrut, editor. Automata networks: LITP Spring = School on=20 theoretical computer science, Argeles-village, France, May 12-16, = 1986:=20 proceedings, volume 316 of Lecture Notes in Computer = Science,=20 New York, NY, USA, 1988. Springer-Verlag Inc.=20
144=20: Noam Chomsky. Three models for the description of language. = IRE=20 Transactions on Information Theory, IT-2:113-124, 1956.=20
145=20: Noam Chomsky. On certain formal properties of grammars. = Information=20 and Control, 1:137-167, 1958.=20
146=20: Noam Chomsky. Formal properties of grammars. In Handbook of=20 Mathematical Psychology, volume 2, pages 323-418. John Wiley and = Sons,=20 New York, 1963.=20
147=20: Noam Chomsky and George A. Miller. Finite state languages. = Information=20 and Control, 1:91-112, 1958.=20
148=20: B. Chopard. A cellular automata model of large-scale moving = objects.=20 Journal of Physics A, 23(10):1671, 1990.=20
149=20: Bastien Chopard, Pascal Luthi, and Michel Croz. Reaction-diffusion = cellular automata model for the formation of liesegang patterns. = Physical=20 Review Letters, 72(9):1384, 1994.=20
150=20: D. Chowdhury and D. Stauffer. Systematics of the models of the = immune=20 response and the autoimmune response. Journal of Statistical = Physics,=20 59:1019-1042, 1990.=20
151=20: D. Chowdhury and D. Stauffer. Statistical physics of immune = networks.=20 Physica A, 186: 1-2:61-81, 1992.=20
152=20: D. R. Chowdhury, S. Chakraborty, B. Vamsi, and P. P. Chaudhuri. = Cellular=20 automata based synthesis of easily and fully testable FSMs. In M. = Lightner,=20 editor, Proceedings of the IEEE/ACM International Conference on=20 Computer-Aided Design, pages 650-653. IEEE Computer Society = Press,=20 November 1993.=20
153=20: D. Roy Chowdhury, S Basu, and I. Sen Gupta. Design of CAECC - = cellular=20 automata based error correcting code. IEEE Transactions on = Computers,=20 43(6):759, June 1994.=20
154=20: D. Roy Chowdhury, I. Sen Gupta, and Pal Chaudhuri. Cellular = automata based=20 pattern generator for testing RAM. IEE proceedings.E,Computers and = digital=20 tech, 139(6):469, November 1992.=20
155=20: D. Roy Chowdhury, I Sengupta, and P. Pal Chaudhuri. Built-in = self-test.=20 Journal of electronic testing, 5(1):67, February 1994. A = class of=20 two-dimensional cellular automata and their applications in random = pattern=20 testing.=20
156=20: D. Roy Chowdhury, P Subbarao, and P. Pal Chaudhuri. = Characterization of=20 two-dimensional cellular automata using matrix algebra. = Information=20 sciences, 71(3):289, July 1993.=20
157=20: Kim Christensen, Henrik Jeldtoft Jensen, and Hans C Fogedby. = Dymanical and=20 spatial aspects of sandpile cellular automata. Journal of = Statistical=20 Physics, 63(3 / 4):653, May 1991.=20
158=20: S. K Chung and H. F Chau. On the structure of absolute steady = states in=20 sandpile type of cellular automata: The geometrical aspect. = Journal of=20 mathematical physics, 34(9):4014, September 1993.=20
159=20: Valerio Cimagalli and Marco Balsi. Cellular neural networks: a = review.=20 Prooceedings of the Sixth Italian Workshop on Parallel = Architectures and=20 Neural Networks, Vietri sul Mare, Italia, May 12-14, World Scientific = (E.=20 Caianiello, ed.), 1993.=20
160=20: Gerardo Cisneros and Harold V. McIntosh. Technical report, = Universidad=20 Autonoma de Puebla, 1986.=20
161=20: Clementi and Impagliazzo. Graph theory and interactive protocols = for=20 reachability problems on finite cellular automata. In Italian = Conference=20 on Algorithms and Complexity, 1994.=20
162=20: A. Clementi and P. Pierini. Computational complexity of the finite = cellular automata reversibility problem. In Fourth Italian = Conference of=20 Theoretical Computer. World scientific, 1992.=20
163=20: Paul Cockshott, George McCaskill, and Peter Barrie. Use of a high = speed=20 cellular automata machine to simulate road traffic. Technical Report=20 HDV-27-93, Department of Computer Science, University of Strathclyde, = 1993.=20
164=20: E. F. Codd. Cellular Automata. Academic Press, New York, = 1968.=20
Codd's PhD thesis in which he details an 8-state, = self-reproducing,=20 universal computer/constructor.=20
165=20: Codenotti and Margara. Transitive cellular automata are sensitive. = AMM: The American Mathematical Monthly, 103, 1996.=20
166=20: R. L Colasanti and J. P Grime. Resource dynamics and vegetation = processes:=20 a deterministic model using two-dimensional cellular automata. = Functional=20 ecology, 7(2):169, 1993.=20
167=20: J. H. Conway. Regular Algebra and Finite Machines. = Chapman and=20 Hall, Ltd., London, 1971. ISBN 412-10620-5.=20
168=20: R. Cordovil, R. Dil=E3o, and A. N. da Costa. Periodic orbits for = additive=20 cellular automata. Discrete Comput. Geom., 1:277-288, 1986.=20
169=20: R. Cori and Y. M=E9tivier. Approximation of a trace, asynchronous = automata=20 and the ordering of events in a distributed system. In Proceedings = of the=20 15th International Colloquium on Automata, Languages and Programming=20 (ICALP'88), number 317 in LNCS, pages 147-161. Springer, 1988.=20
170=20: Robert Cori, Yves Metivier, and Wieslaw Zielonka. Asynchronous = mappings=20 and asynchronous cellular automata. Information and = computation,=20 106(2):159, October 1993.=20
171=20: Ethan M. Coven and Michael E. Paul. Endomorphisms of irreducible = subshifts=20 of finite type. Mathematical Systems Theory, 8:167-175, 1974. =
172=20: Ethan M. Coven and Michael E. Paul. Sofic systems. Israel = Journal of=20 Mathematics, 20:165-177, 1975.=20
173=20: Ethan M. Coven and Michael E. Paul. Finite procedures for sofic = systems.=20 Monatshefte fuer Mathematik, 83:265-278, 1977.=20
174=20: M. Creutz. Microcanonical monte carlo simulation. Physical = Review=20 Letters, 50:1411-1414, 1983.=20
175=20: M. Creutz. Deterministic Ising dynamics. Annals of = Physics,=20 167:62-72, 1986.=20
176=20: M. Creutz, P. Mitra, and K. J. M. Moriarty. A fast algorithm for=20 investigations on the three-dimensional Ising model. Computer = Physics=20 Communications, 33:361-366, 1984.=20
177=20: B. Creutzburg. Parallel conflict-free optimal access to complete = extended=20 q-ary trees. In G. Wolf, T. Legendi, and U. Schendel, editors, = Proceedings=20 of the 4th International Workshop on Parallel Processing by Cellular = Automata=20 and Arrays, pages 248-255. LNCS 342. Springer, October 1988.=20
178=20: J. Crutchfield. Hunting for transients and cycles. unpublished = notes, March 1988.=20
179=20: J. P Crutchfield and J. E Hanson. Turbulent pattern bases for = cellular=20 automata. Physica D, 69(3 / 4):279, 1993.=20
180=20: J. P. Crutchfield and K. Kaneko. Phenomenology of spatio-temporal = chaos.=20 In Hao Bai-lin, editor, Directions in Chaos, page 272. World=20 Scientific Publishers, Singapore, 1987.=20
181=20: J. P. Crutchfield and K. Kaneko. Are attractors relevant to = turbulence?=20 Physical Review Letters, 60:2715, 1988.=20
182=20: J. P. Crutchfield and N. H. Packard. From cellular automata to = lattice=20 dynamical systems, (unpublished notes). Unpublished notes, = 1984.=20
183=20: K. Culick and S. Yu. Cellular automata, omega-omega-regular sets, = and=20 sofic systems. Discrete Applied Mathematics, 32:85-101, 1991. =
184=20: K. Culik, Y. Pachl, and S. Yu. On the limit sets of cellular = automata.=20 SIAM Journal of Computing, 18:831-842, 1989.=20
185=20: Karel Culik. On invertible cellular automata. Complex = Systems,=20 1(6):1035-1044, December 1987.=20
186=20: Karel Culik II, Jan Pachl, and Sheng Yu. On the limit sets of = cellular=20 automata. SIAM Journal on Computing, 18(4):831-842, August = 1989.=20
187=20: II Culik, Karel and Simant Dube. Fractal and recurrent behavior of = cellular automata. Complex Systems, 3(3):253-267, June 1989.=20
188=20: Predrag Cvitanovic. Invariant measurement of strange sets in terms = of=20 cycles. Physical Review Letters, 24:2729-2732, 1988.=20
189=20: Luciano R. da Silva, Hans J. Hermann, and Liacir S. Lucena. = Simulations of=20 mixtures of two boolean cellular automata rules. Complex = Systems,=20 2:29-37, 1988.=20
190=20: T Damarla and A Sathaye. Application of one-dimensional cellular = automata=20 and linear feedback shift registers for pseudo-exhastive testing. = IEEE=20 Transactions on Computer-aided design, 12(10):1580, October 1993. =
191=20: A. K. Das, M. Pandey, and A. Gupta. Built-in-self-test structures = around=20 cellular automata and counters. IEEE Proceedings E, = 137(4):269, 1990.=20
192=20: Aloke K Das, Tapas K Nayak, and P. Pal Chaudhuri. On = characterization of=20 state transition graph of additive cellular automata based on depth.=20 Information sciences, 65(3):189, 1992.=20
193=20: Aloke K Das, A Sanyal, and P Palchaudhuri. On characterization of = cellular=20 automata with matrix algebra. Information sciences, = 61(3):251, June=20 1992.=20
194=20: R. Das, M. Mitchell, and J. P. Crutchfield. A genetic algorithm = discovers=20 particle based computation in cellular automata. Technical report, = SFI, 1994.=20 Submitted to the 3rd Parallel ProblemSolving From Nature Conf.=20
195=20: Rajarshi Das, James P. Crutchfield, Melanie Mitchell, and James E. = Hanson.=20 Evolving globally synchronized cellular automata. Technical report, = Santa Fe=20 Institute Working Paper 95-01-005, 1995. via = web via=20 ftp.=20
196=20: J. Davenport and Y. Robert. VLSI and computer algebra: the G.C.D. = example.=20 In Demongeot, Goles, and Tchuente, editors, Dynamical systems and = cellular=20 automata. Academic Press, 1985.=20
197=20: Paul Davies. Cosmic Blueprint. Heinemann, London, 1988.=20
198=20: D. A. Dawson. Stable states of probabilisti cellular automata.=20 Information and Control, 34(2):93-106, June 1977.=20
199=20: H de Garis. An artificial brain: ATRs CAM-brain project aims to=20 build/evolve an artificial brain with a million neural modules inside = a=20 trillion cell cellular automata machine. New generation = computing,=20 12(2):215, 1994.=20
200=20: Hugo de Garis. Evolving a replicator the genetic programming of = self=20 reproduction in cellular automata. In ECAL-93 Self organisation = and life:=20 from simple rules to global complexity, pages 274-284, CP 231, = Universite=20 Libre de Bruxelles, Bld. du Triomphe, 1050 Brussels, Belgium, Fax=20 32-2-659.5767 Phone 32-2-650.5776 Email sgross@ulb.ac.be, may 1993.=20
201=20: Hugo de Garis. CAM-BRAIN the genetic programming of an artificial = brain=20 which grows/evolves at electronic speeds in a cellular automata = machine. In=20 Proceedings of the 1994 IEEE World Congress on Computational=20 Intelligence, volume 1, pages 337-339b, Orlando, Florida, USA, = jun 1994.=20 IEEE Press.=20
202=20: Hugo de Garis, Hitoshi Iba, and Tatsumi Furuya. Differentiable=20 chromosomes: The genetic programming of switchable shape-genes. In R = Manner=20 and B Manderick, editors, Parallel Problem Solving from Nature = 2,=20 pages 489-498, Brussels, Belgium, 28-30 1992. Elsevier Science.=20
203=20: de Lassus H. Neural network clusters and cellular automata for the = detection and classification of overlapping transient signals on radio = astronomy spectrograms from spacecraft. R IEEE Conference on time=20 frequency analysis, Paris, June 1996.=20
204=20: P. M. C. de Oliveira, T. J. P. Penna, and S. M. Moss de Oliveira. = Cellular=20 automata as microcanonical simulators. Journal of Physics A,=20 24(1):219, 1991.=20
205=20: Pedro P. B. de Oliveira. A cellular automaton to embed genetic = search. In=20 L. Nadel and D. L. Stein, editors, 1991 Lectures in Complex = Systems,=20 Santa Fe Institute Studies in the Sciences of Complexity, Lectures = Vol. IV,=20 pages 389-408. Addison-Wesley, 1992.=20
206=20: Pedro P. B. de Oliveira. Methodological issues within a framework = to=20 support a class of artificial-life worlds in cellular automata. In D. = G. Green=20 and T. Bossomaier, editors, Complex Systems: From Biology to=20 Computation, pages 82-96, Amsterdam, 1993. IOS Press.=20
207=20: Pedro P. B. de Oliveira. Cellular automata for an approach to = emergent=20 functionality. In Salvatore Di Gregorio and Giandomenico Spezzano, = editors,=20 Proceedings of ACRI'94: Cellular Automata in Research and = Industry,=20 pages 99-111. CRAI (Consorzio per la Ricerca e le Applicazioni di=20 Informatica), S. Stefano di Rende, CS, Italy, September 1994.=20
208=20: Pedro P. B. de Oliveira. Coupling computations through space. In = W. Porod=20 and G. Frazier, editors, Physics and Computation: This Decade and=20 Beyond. IEEE Press, Los Alamitos, CA, USA, November 1994.=20
209=20: Pedro P. B. de Oliveira. Simulation of exaptive behaviour. In Y. = Davidor;=20 H.-P. Schwefel and R. Maenner, editors, Parallel Problem Solving = from=20 Nature, 3, Lecture Notes in Computer Science 866, pages 354-364. = Berlin,=20 Germany, Springer-Verlag, October 1994.=20
210=20: Pedro P. B. de Oliveira. Collapsing a coevolutionary process into = a=20 computable function. BioSystems: Journal of Biological and = Information=20 Processing Sciences, 1995. In press.=20
211=20: Pedro P. B. de Oliveira. An empirical exploration of computations = with a=20 cellular-automata-based artificial life world. Cognitive Science = Research=20 Report CSRP-373/95, School of Cognitive and Computing Sciences, = University of=20 Sussex, England, March 1995.=20
212=20: Paula Gonzaga de S=E1 and Christian Maes. The = G=E1cs-Kurdyumov-Levin Automaton=20 revisited. Journal of Statistical Physics, 67(3/4):607-622, = May 1992.=20
213=20: P Deadman, R. D Brown, and H. R Gimblett. Modelling rural = residential=20 settlement patterns with cellular automata. Journal of = environmental=20 management, 37(2):147, February 1993.=20
214=20: M Deffner. Computer simulation of immunological cellular automata: = The=20 tsallis model. Physica A, 195(3 / 4):279, May 1993.=20
215=20: P. Dehne and J.-R. Sack. A survey of parallel computational = geometry=20 algorithms. In G. Wolf, T. Legendi, and U. Schendel, editors, = Proceedings=20 of the 4th International Workshop on Parallel Processing by Cellular = Automata=20 and Arrays, pages 73-88. LNCS 342. Springer, October 1988.=20
216=20: J. Demongeot, E. Goles, and M. Tchuente, editors. Dynamical = Systems=20 and Cellular Automata, Proceedings of the Conference on Dynamical = Behaviour of=20 Cellular Automata: Theory and Applications, Luminy, France, = September=20 13-17, 1983. Academic Press, London.=20
217=20: A. K. Dewdney. Computer recreations - building computers in one = dimension=20 sheds light on irreducibly complicated phenomena. Scientific=20 American, pages 10-16, May 1985.=20
218=20: A. K. Dewdney. The game life aquires some successors in three = dimensions.=20 Scientific American, 224(2):112-118, February 1987.=20
219=20: A. K. Dewdney. The Armchair Universe, volume ISBN = 0-7167-1939-8=20 pbk. W. H. Freeman and Company, New York, 1988.=20
220=20: A. K. Dewdney. Computer recreations: The hodgepodge machine makes = waves.=20 Scientific American, pages 104-107, August 1988.=20
221=20: A. K. Dewdney. The hodgepodge machine makes waves. Scientific=20 American, 225(8), August 1988.=20
222=20: A. K. Dewdney. Computer recreations: A cellular universe of = debris,=20 droplets, defects and demons. Scientific American, pages = 102-105,=20 August 1989.=20
223=20: V. Diekert. Combinatorial rewriting on traces. In C. Choffrut et = al.,=20 editors, Proceedings of (STACS'90), Rouen (France), number = 415 in=20 LNCS, pages 138-151. SPRINGER, 1990.=20
224=20: Rui M. A. Dilao. Periodic points and entropies for cellular = automata.=20 Complex Systems, 3(2):117-128, April 1989.=20
225=20: G. D. Doolen. Lattice Gas Methods for PDE's, Theory, = Applications and=20 Hardware. North-Holland, 1991.=20
226=20: T. Drayer, W. King, J. Tront, and R. Conners. MORRPH: A MOdular = and=20 reprogrammble real-time processing hardware. In D. A. Buell and K. L. = Pocek,=20 editors, Proceedings of IEEE Workshop on FPGAs for Custom = Computing=20 Machines, pages 11-19, Napa, CA, April 1995.=20
227=20: M. Dresden and D. Wong. Life games and statistical models. = Proceedings=20 of the National Academy of Sciences (U.S.A., 72:956-960, 1975.=20
228=20: J. A. M. S Duarte, Muhammad Sahimi, and Joao Marques de Carvalho. = Dynamic=20 permeability of porous media by cellular automata. Journal de=20 physique, 2(1):1, 1992.=20
229=20: Michel Dubois-Violette and Alain Rouet. A mathematical = classification of=20 the one-dimensional deterministic cellular automata. = Communications in=20 Mathematical Physics, 112:627-631, 1987.=20
230=20: Werner Duchting. Tumor growth simulation. Computers and = Graphics,=20 14(3/4):505-508, 1990.=20
231=20: Durand. Undecidability of the surjectivity problem for 2D cellular = automata: A simplified proof. Fundamentals (or Foundations) of = Computation=20 Theory, 9, 1993.=20
232=20: B. Durand. Global properties of 2D cellular automata: some = complexity=20 results. In MFCS'93, Lecture Notes in Computer Science. = Springer=20 Verlag, September 1993.=20
233=20: B. Durand. Global properties of 2D cellular automata: Some = complexity=20 results. In A. M. Borzyszkowski and S. Sokolowski, editors, = Proceedings of=20 Mathematical Foundations of Computer Science (MFCS '93), pages = 433-441.=20 LNCS 711. Springer, September 1993.=20
234=20: B. Durand. Undecidability of the surjectivity problem for 2D = cellular=20 automata: A simplified proof. In FCT'93, Lecture Notes in = Computer=20 Science. Springer Verlag, August 1993.=20
235=20: B. Durand. Undecidability of the surjectivity problem for 2D = cellular=20 automata: A simplified proof. In Z. Esik, editor, Proceedings of=20 Fundamentals of Computation Theory (FCT '93), pages 204-211. LNCS = 710.=20 Springer, August 1993.=20
236=20: B. Durand. Automates cellulaires: r=E9versibilit=E9 et = complexit=E9.=20 PhD thesis, Ecole Normale Sup=E9rieure de Lyon, 1994.=20
237=20: B. Durand. Inversion of 2D cellular automata: some complexity = results.=20 Theoretical Computer Science, 134:387-401, 1994.=20
238=20: B. Durand. Inversion of 2D cellular automata: some complexity = results.=20 Theoretical Computer Science, 134(2):387-401, 1994.=20
239=20: B. Durand. The surjectivity problem for 2D cellular automata. = Journal=20 of Computer and Systems Science, 49(3):718-725, 1994.=20
240=20: B. Durand. A Random NP-complete problem for inversion of 2D = cellular=20 automata. In STACS'95, volume 900 of Lecture Notes in = Computer=20 Science. Springer Verlag, March 1995.=20
241=20: B. Durand. A Random NP-complete problem for inversion of 2D = cellular=20 automata. Theoretical Computer Science, (to appear).=20
242=20: Bruno Durand. A random NP-complete problem for inversion of 2D = cellular=20 automata. Theoretical Computer Science, 148(1):19-32, 1995.=20
243=20: Rick Durret. Some new games for your computer. Nonlinear = Science=20 Today, 1(4):1-7, 1991.=20
244=20: Richard Durrett and Jeffrey E. Steif. Some rigorous results for = the=20 greenberg-hastings model. Journal of Theoretical Probability, = 4:669-690, 1991.=20
245=20: Charles R. Dyer. One-way bounded cellular automata. = Information and=20 Control, 44(3):261-281, March 1980.=20
246=20: Charles R. Dyer and Azriel Rosenfeld. Triangle cellular automata.=20 Information and Control, 48(1):54-69, January 1981.=20
247=20: C. Dytham and B. Shorrocks. Selection, patches and genetic = variation: a CA=20 modelling drosophila populations. Evolutionary Ecology, = 6:342-351,=20 1992.=20
248=20: J. D. Eckart. A cellular automata simulation system. SIGPLAN=20 Notices, 26(8):80-85, [8] 1991.=20
249=20: J. D. Eckart. A parallel extendible scalable cellular automata = machine:=20 PE-SCAM. In J. P. Agrawal, V. Kumar, and V. Wallentine, editors,=20 Proceedings of the Conference on Computer Science, pages = 467-472. ACM=20 Press, March 1992.=20
250=20: J. Dana Eckart. A cellular automata simulation system: Version = 2.0.=20 SIGPLAN notices, 27(8):99, August 1992.=20
251=20: B. Mikolajczak (ed.). Algebraic and structural automata theory. = Annals=20 of Disc. Math, 44, 1991.=20
252=20: Samuel Eilenberg. Automata, Languages, and Machines. = Academic=20 Press, New York, 1974. (ISBN 0-12-234001-9.=20
253=20: M. Eisele. Long-range correlations in chaotic cellular automata.=20 Physica D, 48:295-310, 1991.=20
254=20: W Eissler, P Drtina, and A Frohn. Cellular automata simulation of = flow=20 around chains of cylinders. International Journal for numerical = methods in=20 e, 34(3):773, 1992.=20
255=20: K Eloranta. Partially premitive cellular automata. = Nonlinearity,=20 6(6):1009, November 1993.=20
256=20: K Eloranta. Random walks in cellular automata. = Nonlinearity,=20 6(6):1025, November 1993.=20
257=20: Kari Eloranta. The dynamics of defect ensembles in one-dimesional = cellular=20 automata. Journal of Statistical Physics, 76(5 / 6):1377, = September=20 1994.=20
258=20: Irving R. Epstein. Spiral waves in chemistry and biology.=20 Science, 252:67, 1991.=20
259=20: G. Bard Ermentrout and Leah Edelstein-Keshet. Cellular automata = approaches=20 to biological modeling. Journal of Theoretical Biology, = 160:97-133,=20 January 1993.=20
260=20: M. H Ernst and Shankar P Das. Thermal cellular automata fluids.=20 Journal of Statistical Physics, 66(1 / 2):465, January 1992.=20
261=20: M. H. Ernst and J. W. Dufty. Green-kubo relations for lattice gas = cellular=20 automata. Physics Letters, 138(8):391, 1989.=20
262=20: F. C. Richards et al. Extracting CA rules directly from = experimental data.=20 Physica D, 45:189, 1990.=20
263=20: G. D. Doolen et al. Lattice gas methods for partial = differential=20 equations. Addison-Wesley, New York, 1990.=20
264=20: K. Culik II et al. Computation theoretic aspects of CA. = Physica=20 D, 45:357, 1990.=20
265=20: K. Culik II et al. Formal languages and global CA behavior. = Physica=20 D, 45:396, 1990.=20
266=20: R. Livi et al. Periodic orbits and long transients in coupled map=20 lattices. Physica D, 45:452, 1990.=20
267=20: Y. Aizawa et al. Soliton turbulence in 1-D CA. Physica D, = 45:307,=20 1990.=20
268=20: D. J. Evans and G. M. Megson. Systolic preconditioning algorithms = for the=20 jacobi iterative solution of sparse linear systems. In G. Wolf, T. = Legendi,=20 and U. Schendel, editors, Proceedings of the 4th International = Workshop on=20 Parallel Processing by Cellular Automata and Arrays, pages = 256-265. LNCS=20 342. Springer, October 1988.=20
269=20: R Eykholt and J. C Ariyasu. Analytic determination of stationary = patterns=20 of cellular automata. Physics Letters A, 159(8 / 9):379, = 1991.=20
270=20: E. Fachini and L. Vassalo. Cellular automata with regular = behavior.=20 Complex Systems, 4(4):385-399, August 1990.=20
271=20: D. Farmer, T. Toffoli, and S. Wolfram, editors. Cellular=20 Automata, New York, 1984.=20
272=20: Doyne Farmer, Tommaso Toffoli, and Stephen Wolfram, editors. = Cellular=20 Automata, Proceedings of an Interdisciplinary Workshop, Los = Alamos, New=20 Mexico, March 7-11, 1983. North-Holland, Amsterdam.=20
273=20: J. D. Farmer, T. Toffoli, and S. Wolfram, editors. Cellular = Automata:=20 Proceedings of an Interdisciplinary Workshop at Los Alamos, New = Mexico, March=20 7-11, 1983, Amsterdam, 1984. North-Holland.
A collection = of papers=20 on the theory and applications of cellular automata.=20
274=20: Rasmus Feldberg, Carsten Knudsen, and Steen Rasmussen. Recursive=20 definition of global cellular-automata mappings. Physical Review = E,=20 49(2):1699, February 1994.=20
275=20: R. Fisch. Cyclic CA and related processes. Physica D, = 45:19,=20 1990.=20
276=20: A. S. Fokas, E. P. Papadopoulou, and Y. G. Saridakis. Coherent = structures=20 in cellular automata. Physics Letters A, 147:7:369-379, 1990. =
277=20: A. S. Fokas, E. P. Papadopoulou, and Y. G. Saridakis. Soliton = cellular=20 automata. Physica D, 41:297-321, 1990.=20
278=20: A. S. Fokas, E. P. Papadopoulu, Y. G. Saridakis, and M. J. = Ablowitz.=20 Interaction of simple particles in soliton cellular automata. = Studies in=20 Applied Mathematics, 81:153-180, 1989.=20
279=20: Athanassios S. Fokas, Elena P. Papadopoulou, and Yiannis G. = Saridakis.=20 Particles in soliton cellular automata. Complex Systems,=20 3(6):615-633, December 1989.=20
280=20: Gary Arthur Ford. An Investigation of Embeddings of Cellular = Spaces=20 for Cellular Automata. PhD thesis, Ann Arbor, 1977.=20
281=20: Donald R Franceschetti, D. Wayne Jones, and Bruce W Campbell. = Hamming=20 sets, ising sets, cellular automata, neural nets, and the random walk. = American Journal of Physics, 61(1):50, January 1993.=20
282=20: E. Fredkin. Digital mechanics: An informational process based on=20 reversible universal CA. Physica D, 45:254, 1990.=20
283=20: Edward Fredkin and Tommaso Toffoli. Conservative logic. = International=20 Journal of Theoretical Physics, 21:219-253, 1982.=20
284=20: H. Fried. The checkerboard update glauber model, cellular automata = and=20 ising models. Journal of Physics A, 23(18):4165, 1990.=20
285=20: Siegfried Fussy, Gerhard Grossing, and Herbert Schwabl. Nonlocal=20 computation in quantum cellular automata. Physical Review A,=20 48(5):3470, November 1993.=20
286=20: P. Gacs. Reliable computation with cellular automata. In Proc. = 15th=20 ACM Symposium on Theory of Computing (STOC), pages 32-41, 1983.=20
287=20: P. Gacs and X. Reif. A simple three-dimensional real-time reliable = cellular array. STOC, 1985.=20
288=20: P. Gacs and X. Reif. A simple three-dimensional real-time reliable = cellular array. JCSS, 36, 1988.=20
289=20: Peter G=E1cs. Reliable computation with cellular automata. = Journal of=20 Computer and Systems Science, 32(1):15-78, February 1986.=20
290=20: Peter G=E1cs. Self-correcting two-dimensional arrays. In Silvio = Micali,=20 editor, Randomness in Computation, volume 5 of Advances = in=20 Computing Research (a scientific annual), pages 223-326. JAI = Press,=20 Greenwich, Conn., 1989.=20
291=20: Michael J Gaeta and Bahram Nassersharif. A stochastic cellular = automata=20 model for neutron transport. Nuclear science and engineering, = 113(1):56, January 1993.=20
292=20: J. A. C. Gallas, P. Grassberger, H. J. Herrmann, and P. Ueberholz. = Noisy=20 collective behavior in deterministic cellular automata. Physica = A,=20 180:19-41, 1992.=20
293=20: Ernest Gallo. Cellular automata and the humanities. Journal of = Computing in higher education, 6(1):63, 1994.=20
294=20: JBC Garcia, MAF Gomes, TI Juh, TI Ren, and TRM Sales. Nonlinear = dynamics=20 of the cellular-automaton 'game of life'. Physical Review E,=20 48(5):3345-3351, nov 1993.=20
295=20: P. L Garcia-Ybarra, A Lopez-Martin, and J. C Antoranz. Unsteady = potential=20 flows computation by cellular automata: The premixed flame = instability.=20 Transport theory and statistical physics, 23(1 / 3):173, = 1994.=20
296=20: M. Gardner. Mathematical Games: On cellular automata, = self-reproduction,=20 the garden of eden and the game of `Life'. Scientific = American,=20 224(2):112-117, February 1971.
Follow-up article on LIFE and = other CA=20 rules.=20
297=20: Martin Gardner. Mathematical games - the fantastic combinations of = john=20 conway's new solitaire game, life. Scientific American, pages = 120-123, October 1970.=20
298=20: Martin Gardner. Wheels, Life, and Other Mathematical = Amusements.=20 W. H. Freeman and Company, New York, 1983. ISBN 0-7167-1589-9.=20
299=20: M. Garzon. Cellular automata and discrete neural networks. = Physica=20 D, 45:431-440, 1990.=20
300=20: P. Gastin and A. Petit. Asynchronous cellular automata for = infinite=20 traces. In W. Kuich, editor, Proceedings on Automata, Languages = and=20 Programming (ICALP '92), pages 583-594. LNCS 623. Springer, July = 1992.=20
301=20: Richard J. Gaylord and Kazume Nishidate. Modeling nature with = cellular=20 automata using Mathematica. Springer-Verlag, Berlin, Germany /=20 Heidelberg, Germany / London, UK / etc., 1996.=20
302=20: Richard J. Gaylord and Paul R. Wellin. Computer Simulations = with=20 Mathematica: Explorations in the Physical and Biological = Sciences. ?,=20 1994.=20
303=20: M. Gerhardt, H. Schuster, and J. J. Tyson. A cellular automata = model of=20 exitable media. Physica D, 46:392-415, 1990.=20
304=20: X. Gerhardt and X. Schuster. A cellular automation describing the=20 formation of spatialy ordered structures in chemical systems. = Physica=20 D, 36:209, 1989.=20
305=20: X. Gerhardt and X. Schuster. Anregungen. Heft, 2:44-50, = 1992.=20
306=20: R. W. Gerling. Classification of 3-state and 4-state cellular = automata.=20 Physica A., 167(3):611, 1990.=20
307=20: R. W. Gerling. Classification of triangular and honeycomb cellular = automata. Physica A, 162:196-209, 1990.=20
308=20: D. Gernert. Cellular automata and the concept of space. In J. = Becker, I.=20 Eisele, and F. M=FCndemann, editors, Parallelism, Learning, = Evolution :=20 Proceedings of the Workshop on Evolutionary Models and = Strategies/Proceedings=20 of the Workshop on Parallel Processing : Logic, Organization, and = Technology=20 (WOPPLOT 89), pages 94-102. LNAI 565. Springer Verlag, July 1989. =
309=20: Reza Gharavi and Venkat Anantharam. Effect of noise on long-term = memory in=20 cellular automata with asynchronous delays between the processors. = Complex=20 Systems, 6(3):287, June 1992.=20
310=20: Glickstein and Stiles. Cellular automata paradigm. IEEE = aerospace and=20 electronic systems magazine, 7(1):32, January 1992.=20
311=20: Jurgen Goicoechea and Jordi Ortin. Hysteresis and return-point = memory in=20 deterministic cellular automata. Physical Review Letters,=20 72(14):2203, 1994.=20
312=20: E Goles, A Maass, and S Martinez. On the limit set of some = universal=20 cellular automata. Theoretical computer science, 110(1):53, = 1993.=20
313=20: Eric Goles and Andrew M. Odlyzko. Decreasing energy functions and = lengths=20 of transients for some cellular automata. Complex Systems,=20 2(5):501-507, October 1988.=20
314=20: Solomon W. Golomb. Shift Register Sequences. Holden-Day, = Inc.,=20 1967.=20
315=20: U. Golze. (A-)synchronous (non-)deterministic cell spaces = simulating each=20 other. J. Computer and Systems Sciences, 17:176-193, 1978.=20
316=20: Gorodkin, Sorensen, and Winther. Neural networks and cellular = automata=20 complexity. Complex Systems, 7, 1993.=20
317=20: Gary R Gorson. Using cellular automata as biological oscilators. = AI=20 expert, 9(9):30, September 1994. Artificial life experiments use = coupled=20 oscillators and the emergent behavior of groups of identical cellular=20 automata.=20
318=20: R. Wm. Gosper. Exploiting regularities in large cellular spaces.=20 Physica D, 10:75-80, 1984.=20
319=20: M. G=F6ssel, V. V. Kaversnev, and B. Rebel. Parallel memories for = straight=20 line and rectangle access. In G. Wolf, T. Legendi, and U. Schendel, = editors,=20 Proceedings of the 4th International Workshop on Parallel = Processing by=20 Cellular Automata and Arrays, pages 89-0. LNCS 342. Springer, = October=20 1988.=20
320=20: Walter Helbig Gottschalk and Gustav Arnold Hedlund. = Topological=20 Dynamics. American Mathematical Society, Providence, Rhode = Island, 1955.=20
321=20: P. Grassberger. Chaos and diffusion in deterministic cellular = automata.=20 Physica D, 10:52-58, 1984.=20
322=20: Peter Grassberger. unknown. Physica D, 10:52, 1984.=20
323=20: Peter Grassberger. appendix. In Stephan Wolfram, editor, = Theory and=20 Applications of Cellular Automata. World Scientific, 1986.=20
324=20: Peter Grassberger. Long-range effects in an elementary cellular = automaton.=20 Journal of Statistical Physics, 45:27-39, 1986.=20
325=20: Peter Grassberger. Problems in quantifying self-generated = complexity.=20 Helvetica Physica Acta, 62:489, 1989.=20
326=20: Lawrence F. Gray. The positive rates problem for attractive = nearest=20 neighbor spin systems on z. Z. Wahrscheinlichkeitstheorie = verw.=20 Gebiete, 61:389-404, 1982.=20
327=20: Lawrence F. Gray. The behavior of processes with statistical = mechanical=20 properties. In Percolation Theory and Ergodic Theory of Infinite = Particle=20 Systems, pages 131-167. Springer-Verlag, 1987.=20
328=20: Green. NP-complete problems in cellular automata. Complex=20 Systems, 1, 1987.=20
329=20: D. G. Green. Simulated effects of fire, dispersal and spatial = pattern on=20 ceompetition within forest mosaics. Vegetation, 82:139-154, = 1982.=20
330=20: D. G. Green. Cellular automata models in biology. Mathematical = and=20 computer modelling, 13(6):69, 1990.=20
331=20: D. G. Green, House A. P. N., and S. M. House. Simulating spatial = patterns=20 in forest ecosystems. Mathematics and Computers in = Simulation,=20 27:191-198, 1985.=20
332=20: David G. Green and Terry J. Bossomaier, editors. Complex = Systems: From=20 Biology to Computation. IOS Press, Amsterdam, 1993.=20
333=20: David Geoffrey Green. Cellular automata models of crown-of-thorns=20 outbreaks. In R. H. Bradbury, editor, Acanthaster and the Coral = Reef:A=20 Theoretical Perspective, volume 88 of Lecture Notes in=20 Biomathematics, pages 169-188. Springer-Verlag, Berlin, 1990.=20
334=20: J. M. Greenberg, C. Greene, and S. Hastings. A combinatorial = problem=20 arising in the study of reaction-diffusion equations. SIAM Journal = of=20 Algebra and Discrete Mathematics, 1:34-42, 1980.=20
335=20: J. M. Greenberg, B. D. Hassard, and S. P. Hastings. Pattern = formation and=20 periodic structures in systems modelled by reaction-diffusion = equations.=20 Bulletin of the American Mathematical Society, 84:1296-1327, = 1978.=20
336=20: J. M. Greenberg and S. P. Hastings. Spatial patterns for discrete = models=20 of diffusion in excitable media. SIAM Journal on Applied = Mathematics,=20 34:515-523, 1978.=20
337=20: S. Di Gregorio and G. Trautteur. On reversibility in cellular = automata.=20 Journal of Computer and System Sciences, 11(3):382-391, = December=20 1975.=20
338=20: Patrick Grim. Undecidability of the spatialized prisoner's = dilemma.=20 Technical report, Group for Logic and Formal Semantics, Dept. of = Philosophy,=20 SUNY at Stony Brook, Stony Brook, NY 11794. request to=20 PGRIM@ccmail.sunysb.edu, report number 94-01.=20
339=20: G. Grinstein, C. Jayaprakash, and Yu He. Statistical mechanics of=20 probabilistic cellular autonata. Physical Review Lettrers,=20 65:2527-2530, 1985.=20
340=20: G Grossing and A Zeilinger. Zeno's paradox in quantum cellular = automata.=20 Physica D, 50(3):321, July 1991.=20
341=20: Gerhard Gr=F6ssing and Anton Zeilinger. A conservation law in = quantum=20 cellular automata. Physica D, 31:70-77, 1988.=20
342=20: Gerhard Grossing and Anton Zeilinger. Quantum cellular automata.=20 Complex Systems, 2(2):197-208, April 1988.=20
343=20: Gerhard Grossing and Anton Zeilinger. Quantum cellular automata: A = corrigendum. Complex Systems, 2(5):611-623, October 1988.=20
344=20: Jozef Gruska. Why we should not any longer only repair, polish, = and iron=20 current computer science educations. Paper von Vollmar. Preliminary = version=20 Dec 17, 1991. new concept of computer science education, examples of = profound=20 theoretical advances in parallel computing (complexity issues and = cellular=20 automata), December 1991.=20
345=20: P. Guan. Cellular automaton public-key cryptosystems. Complex=20 Systems, 1, 1987.=20
346=20: Puhua Guan and Yu He. Upper bound on the number of cycles in=20 border-decisive cellular automata. Complex Systems, = 1:181-186, 1987.=20
347=20: H. Gutowitz. Frequently asked questions about cellular automata.=20 periodically updated.=20 http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html.=20
348=20: H. Gutowitz. Mean field vs. wolfram classification of cellular = automata.=20 1989.=20
349=20: H. Gutowitz. Cellular automata and the sciences of complexity.=20 Complexity, in press, 1996. review in two parts of some = problems in=20 CA.=20
350=20: H. Gutowitz and C. Langton. Methods for designing 'interesting' = cellular=20 automata. CNLS News Letter, 1988.=20
351=20: H. A. Gutowitz and J. D. Victor. Local structure theory in more = than one=20 dimension. Complex Systems, 1:57-68, 1987.=20
352=20: H. A. Gutowitz and J. D. Victor. Local structure theory: = Calculation on=20 hexagonal arrays, and the interaction of rule and lattice. Journal = of=20 Statistical Physics, 54:495-514, 1989.=20
353=20: H. A. Gutowitz, J. D. Victor, and B. W. Knight. Local structure = theory for=20 cellular automata. Physica D, 28:18-48, 1987.=20
354=20: H.A. Gutowitz and C. Domain. The topological skeleton of cellular=20 automaton dynamics. Physica D, accepted, 1995.=20
355=20: H.A. Gutowitz and Chris Langton. Mean field theory of the edge of = chaos.=20 In F. Moran, A. Moreno, J.J. Merelo, and P. Chacon, editors, = Advances in=20 Artificial Life: Proceedings of the Third European Conference on = Artifical=20 Life, number 929 in Lecture Notes In Artificial Intelligence. = Springer,=20 1995.=20
356=20: Howard Gutowitz. Statistical properties of cellular automata in = the=20 context of learning and recognition. part I: Introduction. In K. H. = Zhao,=20 editor, Learning and Recognition-A Modern Approach, pages = 233-255.=20 World Scientific Publishing, Singapore, 1989.=20
357=20: Howard Gutowitz. Statistical properties of cellular automata in = the=20 context of learning and recognition. part II: Inverting local = structure theory=20 equations to find cellular automata with specified properties. In K. = H. Zhao,=20 editor, Learning and Recognition-A Modern Approach, pages = 256-280.=20 World Scientific Publishing, Singapore, 1989.=20
358=20: Howard Gutowitz. A hierarchical classification of CA. Physica = D,=20 45:136, 1990.=20
359=20: Howard Gutowitz. Introduction (to cellular automata). Physica = D,=20 45:vii, 1990.=20
360=20: Howard Gutowitz. Maps of recent CA and lattice gas automata = literature.=20 Physica D, 45:477, 1990.=20
361=20: Howard Gutowitz, editor. Cellular Automata: Theory and=20 Experiment, 1991. Published as Physica D45 (1990) Nos. 1-3, and = as MIT=20 press book.=20
362=20: Howard Gutowitz. Transients, cycles and complexity in cellular = automata.=20 Physical Review A, 44(12):7881-7884, December 1991.=20
363=20: Howard Gutowitz. Method and apparatus for encryption, decryption, = and=20 authentication using dynamical systems. U.S. Patent 5,365,589 = Issued Nov.=20 15, 1994, 1992.=20
364=20: Paul Halpern. Sticks and stones: a guide to structurally dynamic = cellular=20 automata. American Journal of Physics, 57(5):405-408, May = 1989.=20
365=20: Paul Halpern and Gaetano Caltagirone. Behavior of topological = cellular=20 automata. Complex Systems, 4(6):623-651, December 1990.=20
366=20: W. H=E4ndler. Multiprocessor arrays: Topology, efficiency and=20 faulttolerance. In G. Wolf, T. Legendi, and U. Schendel, editors,=20 Proceedings of the 4th International Workshop on Parallel = Processing by=20 Cellular Automata and Arrays, pages 15-32. LNCS 342. Springer, = October=20 1988.=20
367=20: Per Brinch Hansen. Parallel cellular automata: A model program for = computational science. Concurrency: Practice and Experience,=20 5(5):425-448, August 1993.=20
368=20: Fred Hapgood. Let there be life. Omni, 9(7):40-46 and = 116-117,=20 April 1987.=20
369=20: Harao and Noguchi. Fault tolerant cellular automata. Journal = of=20 Computer and Systems Sciences, 11, 1975.=20
370=20: Masateru Harao and Shoichi Noguchi. Fault tolerant cellular = automata.=20 Journal of Computer and System Sciences, 11(2):171-185, = October 1975.=20
371=20: H. Hartman and P. Tamayo. Reversible CA and chemical turbulence.=20 Physica D, 45:293, 1990.=20
372=20: H. Hartman and G. Vichniac. Inhomogenous cellular automata. In E.=20 Bienenstock and et al., editors, Disordered Systems and Biological = Organization. unknown, 1900.=20
373=20: Juris Hartmanis. In J. Wiederman and P. Hajek, editors, On the = Computing Paradigm and Computational Complexity MFCS'95, volume = LNCS=20 No.969, pages 82-92. Springer, Berlin, 1995. In this paper you will = find an=20 overview of the state of affairs in computational complexity theory. = Note that=20 the author is probably No.1 world authority in the subject. The paper = includes=20 also an interesting disscussion of recent Adleman's molecular solution = of the=20 Hamiltonian path problem. The conclusion is that even molecular = computations=20 can not escape the exponential curse. The weight of "soup" becomes=20 prohibitive. The calculations show that for a graph with 200 nodes the = biologically encoded set of paths will weight more than the Earth ! = The=20 exponential function grows too fast and even atoms are a bit too heavy = to=20 break this barrier.=20
374=20: Wilhelm Hasselbring. CELIP: A cellular language for imaging = processin.=20 Parallel Computing, 14:99-109, 1990.=20
375=20: B. Hasslacher and D. A. Meyer. Knot invariants and CA. Physica = D,=20 45:328, 1990.=20
376=20: Tadatsugu Hatori. Magnetohydynamic cellular automata. Progress = of=20 Theoretical Physics (supplement), (99):229, 1989.=20
377=20: Brian Hayes. Computer recreations - the cellular automaton offers = a model=20 of the world and a world unto itself. Scientific American, = pages=20 10-16, March 1984.=20
378=20: Tom Head. One-dimensional cellular automata: Injectivity from = unambiguity.=20 Complex Systems, 3(4):343-348, August 1989.=20
379=20: G. A. Hedlund. Endomorphisms and automorphisms of the shift = dynamical=20 system. Mathematical Systems Theory, 3:320-375, 1969.=20
380=20: J=F6rg Heitk=F6tter. HODGE-C: An implementation of Gerhard and = Schuster's=20 hodge-podge machine. C source code, Systems Analysis Research Group, = LSXI,=20 University of Dortmund, Department of Computer Science, D-44221 = Dortmund,=20 Germany, March 1993. Available via anon. ftp to=20 lumpi.informatik.uni-dortmund.de as file `hodge-c-0.98j.tar' = in=20 /pub/CA/src.=20
381=20: Hellwagner. A fault detection method in partially utilized = cellular=20 (systolic) arrays. In Proceedings of the 3rd International = Workshop on=20 Parallel Processing by Cellular Automata and Arrays.=20 North-Holland/Akademie-Verlag, 1986.=20
382=20: Hemmerling. On the power of cellular parallelism. In = Proceedings of=20 the 3rd International Workshop on Parallel Processing by Cellular = Automata and=20 Arrays. North-Holland/Akademie-Verlag, 1986.=20
383=20: Hemmerling. Real-time recognition of some languages by trellis and = cellular automata and full scan turing machines. Bulletin of the = European=20 Association for Theoretical Computer Science, 29, 1986.=20
384=20: A Hemmerling. Concentration of multidimensional tape-bounded = systems fo=20 turing automata and cellular spaces. Proc. FCT 79, pages = 167-174,=20 1979.=20
385=20: A. Hemmerling. Systeme von turing-automaten und zellularraume auf=20 rahmbaren pseudomustermengen. EIK 15, pages 47-74, 1979.=20
386=20: A. Hemmerling. On the computational equivalence of synchronous and = asynchronous cellular spaces. Elektronische = Informationsverarbeitung und=20 Kybernetik, (now J. Inf. Process. Cybern. EIK), 18:423-434, 1982. =
387=20: Armin Hemmerling. Concentration of multidimensional tape-bounded = systems=20 of Turing automata and cellular spaces. In L. Budach, editor, = Fundamentals=20 of Computation Theory, pages 167-174, Berlin, 1979. = Akademie-Verlag.=20
388=20: Armin Hemmerling. Systeme von Turing-Automaten und Zellularr=E4ume = auf=20 rahmbaren Pseudomustermengen. Elektronische = Informationsverarbeitung und=20 Kybernetik, 15(1/2):47-72, 1979.=20
389=20: J Hemmingsson and H. J Herrmann. On oscillations in cellular = automata.=20 Europhysics Letters, 23(1):15, July 1993.=20
390=20: J Hemmingsson and Gongwen Peng. Phase transition from periodic to=20 quasiperiodic behaviour in 4D cellular automata. Journal of = Physics=20 A, 27(8):2735, 1994.=20
391=20: Kelvin C. Henry. Exploring cellular automata using a = two-dimensional=20 genetic algorithm. In John R. Koza, editor, Genetic Algorithms at = Stanford=20 1994, pages 57-66. Stanford Bookstore, Stanford, California, = 94305-3079=20 USA, December 1994.=20
392=20: G. T. Herman and G. Rozenberg. Developmental Systems and=20 Languages. North-Holland, 1975.=20
393=20: H. J. Herrmann. Fast algorithm for the simulation of Ising models. = Journal of Statistical Physics, 45:145-151, 1986.=20
394=20: H. W Hesselbarth and I. R Gnobel. Simulation of recrystallization = by=20 cellular automata. Acta metallurgica et materialia, = 39(9):2135,=20 September 1991.=20
395=20: H. W Hesselbarth and E Steck. A simulation of dislocation = patterning=20 derived from cellular automata. Solid state phenomena, 23 / = 24:445,=20 1992.=20
396=20: D. Hiebeler. A brief review of CA packages. Physica D, = 45:463,=20 1990.=20
397=20: W D Hillis. The connection machine: a computer architecture based = on=20 cellular automata. Physica, 10(D):213-228, 1984. HILLIS84.=20
398=20: D Hillman. The structural of reversible one-dimensional cellular = automata.=20 Physica D, 52(2 / 3):277, September 1991.=20
399=20: David Hillman. The structure of reversible one-dimensional = cellular=20 automata. Physica D, 54:277-292, 1991.=20
400=20: A. Hlawiczka and M. Kopec. Concatenable cellular automata register = design=20 for built-in self-test. In IEEE, editor, Proceedings of the = European=20 Conference on Design Automation, pages 164-168. IEEE Computer = Society=20 Press, March 1992.=20
401=20: A. Hof and O. Knill. Cellular automata with almost periodic = initial=20 conditions. Nonlinearity, 8:477-491, 1995.=20
402=20: P. Hogeweg. Cellular automata as a paradigm for ecological = modeling.=20 applied Mathematics and Computation, 27:81-100, 1988.=20
403=20: P. Hogeweg and B. Hesper. Crowns crowding:an individual oriented = model of=20 the acanthaster phenomenon. In R. H. In Bradbury, editor, = Acanthaster and=20 the Coral Reef:A Theoretical Perspective, volume 88 of = Lecture Notes=20 in Biomathematics, pages 169-188. Springer-Verlag, Berlin, 1990.=20
404=20: J. Andrew Holey and Oscar H. Ibarra. Triangulation, voronoi = diagram, and=20 convex hull in K-space on mesh-connected arrays and hypercubes. In=20 Proceedings of the 1991 International Conference on Parallel=20 Processing, volume III, Algorithms &; Applications, pages=20 III-147-III-150, Boca Raton, FL, August 1991. CRC Press.=20
405=20: Holland. Hierarchical descriptions, universal spaces, and adaptive = systems. In Essays on Cellular Automata, ed. Arthur W. Burks, = University=20 of Illinois Press, Urbana, Chicago, London. 1970.=20
406=20: Holland. Iterative circuit computers. In Essays on Cellular = Automata,=20 ed. Arthur W. Burks, University of Illinois Press, Urbana, Chicago,=20 London. 1970.=20
407=20: Holland. Outline for a logical theory of adaptive systems. In = Essays=20 on Cellular Automata, ed. Arthur W. Burks, University of Illinois = Press,=20 Urbana, Chicago, London. 1970.=20
408=20: Holland. A universal computer capable of executing an arbitrary = number of=20 subprograms simultaneously. In Essays on Cellular Automata, ed. = Arthur W.=20 Burks, University of Illinois Press, Urbana, Chicago, London. = 1970.=20
409=20: J. H. Holland. Studies of the spontaneous emergence of = self-replicating=20 systems using cellular automata and formal grammars. In A. Lindenmayer = and G.=20 Rozenberg, editors, Automata, Languages, Development, pages = 385-404.=20 North-Holland, 1976.
A study demonstrating the necessity of = stable=20 sub-configurations for the emergence of reproducing entities in any = reasonable=20 time.=20
410=20: Hollerer and Vollmar. On ``forgetful'' cellular automata. = Journal of=20 Computer and Systems Sciences, 11, 1975.=20
411=20: W. O. H=F6llerer and R. Vollmar. On ``forgetful'' cellular = automata.=20 Journal of Computer and System Sciences, 11(2):237-251, = October 1975.=20
412=20: Hortensius, Card, McLeod, and Pries. Importance sampling for ising = computers using one-dimensional cellular automata. IEEE = Transactions on=20 Computers, 38, 1989.=20
413=20: Hortensius, McLeod, Pries, Miller, and Card. Cellular = automata-based=20 pseudorandom number generators for built-in self-test. IEEE = Transactions=20 on Computer-Aided Design of Integrated Circuits and Systems, 8, = 1989.=20
414=20: P. D. Hortensius, R. D. McLeod, and H. C. Card. Parallel random = number=20 generation for VLSI systems using cellular automata. IEEE trans. = on=20 comp., C-38, 10:1466-1473, 1989.=20
415=20: P. D. Hortensius, R. D. McLeod, and H. C. Card. Cellular = automata-based=20 signature analysis for built-in self-test. IEEE Transactions on=20 Computers, 39(10):1273-1283, [10] 1990.=20
416=20: P. D. Hortensius, R. D McLeod, and B. W. Podaima. Cellular = automata=20 circuits for built-in self-test. Ibm journal of research and=20 development, 34(2 / 3):389, 1990.=20
417=20: P. D. Hortensius, R. D. McLeod, and B. W. Podaima. Cellular = automata=20 circuits for built-in self-test. IBM Journal of Research and=20 Development, 34(2/3):389-405, 1990.=20
418=20: N. Howard, R. Taylor, and N. Allinson. The design and = implementation of a=20 massively-parallel fuzzy architecture. Proc. IEEE, pages = 545-552,=20 March 1992.=20
419=20: N. Howard and R. W. Taylor. Reconfigurable logic: technology and=20 applications. Computing &; Control Engineering Journal,=20 3(5):235-240, September 1992.=20
420=20: J Huang, G Narkounskaia, and D. L Turcotte. A cellular-automata=20 slider-block model for earthquakes.-II. demonstration of = self-organized=20 criticality for a 2-D system. Geophysical journal = international,=20 111(2):259, November 1992.=20
421=20: B. A. Huberman and N. Glance. Evolutionary games and computer = simulations.=20 Proceedings of the National Academy of Sciences, USA, = 90:7716-7718,=20 August 1993.=20
422=20: L. P Hurd, J Kari, and K Culik. The topological entropy of = cellular=20 automata is uncomputable. Ergodic theory and dynamical = systems, 12 p=20 2:255, June 1992.=20
423=20: Lyman P. Hurd. Formal language characterizations of cellular = automaton=20 limit sets. Complex Systems, 1:69-80, 1987.=20
424=20: Lyman P. Hurd. The non-wandering set of a CA map. Complex=20 Systems, 2:549-554, 1988.=20
425=20: Lyman P. Hurd. Nonrecursive cellular automata invariant sets. = Complex=20 Systems, 4(2):131-138, April 1990.=20
426=20: Lyman P. Hurd. Nonrecursive cellular automata invariant sets. = Complex=20 Systems, 4(2):131-138, April 1990.=20
427=20: Lyman P. Hurd. Recursive cellular automata invariant sets. = Complex=20 Systems, 4(2):119-129, April 1990.=20
428=20: M. Hurley. Ergodic aspects of cellular automata. Ergodic = theory and=20 dynamical systems, 10(4):671, 1990.=20
429=20: Mike Hurley. Varieties of periodic attractor in cellular automata. = Transactions of the american mathematical society, = 326(2):701, August=20 1991.=20
430=20: Mike Hurley. Attractors in restricted cellular automata. = Proceedings=20 of the American Mathematical Society, 115(2):563, June 1992.=20
431=20: J. Hutchinson. Fractal and self-similarity. Indiana Univ. = Journal of=20 Mathematics, 30(5):713-747, 1981.=20
432=20: O. H. Ibarra, T. Jiang, and H. Wang. String editing on a one-way = linear=20 array of finite-state machines. IEEE Transactions on = Computers,=20 41:1:112-118, 1992.=20
433=20: O. H. Ibarra, S. M. Kim, and S. Moran. Sequential machine=20 characterizations of trellis and cellular automata and applications. = SIAM-=20 JC, 14:426-447, 1985.=20
434=20: Oscar H. Ibarra and Tao Jiang. On one-way cellular arrays. = SIAM=20 Journal on Computing, 16:1135-1154, 1987.=20
435=20: Shin ichi Tadaki. Orbits in one-dimensional finite linear cellular = automata. Physical Review E, 49(2):1168, February 1994.=20
436=20: Shin ichi Tadaki and Shinya Matsufuji. Periodicity in = one-dimensional=20 finite linear cellular automata. Progress of Theoretical = Physics,=20 89(2):325, February 1993.=20
437=20: K. Culik II, J Pachl, and S Yu. On the limit sets of cellular = automata.=20 SIAM Journal of Computing, 18(4):831, 1989.=20
438=20: K. Culik II and S. Yu. Undecidability of CA classification = schemes.=20 Complex Systems, 2:177-190, 1988.=20
439=20: Ilachinski and Halpern. Structurally dynamic cellular automata.=20 Complex Systems, 1, 1987.=20
440=20: Ishii. Measure theoretic approach to the classification of = cellular=20 automata. Discrete Applied Mathematics and Combinatorial = Operations=20 Research and Computer Science, 39:125, 1992.=20
441=20: Robert Itami. Cellular worlds-models for dynamic conceptions of = landscape.=20 Landscape Architecture, pages 52-57, July 1988.=20
442=20: Ito, Osato, and Nasu. Linear cellular automata over . Journal of Computer and Systems Sciences, = 27, 1983.=20
443=20: Hiroyuki Ito. Intriguing properties of global structure in some = classes of=20 finite cellular automata. Physica D, 31:318-338, 1988.=20
444=20: Masanobu It=F4, Nobuyasu =D4sato, and Masakazu Nasu. Linear = cellular automata=20 over . Journal of Computer and System = Sciences, 27(1):125-140, August 1983.=20
445=20: E. T. Jaynes. probability theory-the logic of science. = unknown,=20 1900.=20
446=20: T. Jebelean. Cellular automata as parallel devices for language=20 recognition. Analele Univ. Timisoara 26, 3, Univ. Timisoara, = Timisoara,=20 Roumania, 1988.=20
447=20: T. Jebelean. Constant-time recognition of regular languages by = one-way=20 one-dimensional cellular automata. In Proceedings of the = International=20 Conference "300 Jahre Mathematische Gesellschaft in Hamburg" (March = 1990,=20 Hamburg, Germany), May 1990.=20
448=20: T. Jebelean. Real-time recognition of context-free languages by = one-way=20 one-dimensional cellular automata. Analele univ. iasi, Univ. Iasi, = Iasi,=20 Roumania, 1990.=20
449=20: Tudor Jebelean. Long Integer Multiplication by Cellular Automata.=20 Technical report, RISC-Linz, Johannes Kepler University, Linz, = Austria, 1991.=20
450=20: Tudor Jebelean. Long Integer Multiplication by Cellular Automata: = An=20 Annotated Bibliography. Technical report, RISC-Linz, Johannes Kepler=20 University, Linz, Austria, 1993. Draft in progress.=20
451=20: Jen. Preimages and forecasting for cellular automata. In 1989 = Lectures=20 in Complex Systems, The Proceedings of the 1989 Complex Systems Summer = School. Lectures Volumes II and III, Santa Fe Institute/Studies = in the=20 Sciences of Complexity, Addison-Wesley, 1990.=20
452=20: E. Jen. Aperiodicity in one-dimensional CA. Physica D, = 45:3,=20 1990.=20
453=20: E Jen. Exact solvability and quasiperiodicity of one-dimensional = cellular=20 automata. Nonlinearity, 4(2):251, May 1991.=20
454=20: Erica Jen. Global properties of cellular automata. Journal of=20 Statistical Physics, 43:219-242, 1986.=20
455=20: Erica Jen. Scaling of preimages in cellular automata. Complex=20 Systems, 1(6):1045-1062, December 1987.=20
456=20: Erica Jen. Cylindrical cellular automata. Communications in=20 Mathematical Physics, 118:569-590, 1988.=20
457=20: Erica Jen. Linear cellular automata and recurring sequences in = finite=20 fields. Communications in Mathematical Physics, 119:13-28, = 1988.=20
458=20: Erica Jen. Enumeration of preimages in cellular automata. = Complex=20 Systems, 3(5):421-456, October 1989.=20
459=20: C. Jesshope, P. Miller, and J. Yantchev. Programming with active = data ll.=20 In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of = the 4th=20 International Workshop on Parallel Processing by Cellular Automata and = Arrays, pages 1-130. LNCS 342. Springer, October 1988.=20
460=20: Jonoska. Spinal cellular automata. In Advances in Computing = and=20 Information-ICCI: 4th International Conference on Computing and=20 Information. LNCS, Springer-Verlag, 1992.=20
461=20: Kendall Preston Jr. and Michael J. B. Duff. Modern Cellular=20 Automata. Plenum Press, New York, 1984. ISBN 0-306-41737-5.=20
462=20: K. Kaneko. Period-doubling of kink-antikink patterns, = quasiperiodicity in=20 antiferro-like structures and spatial intermittency in coupled = logistic=20 lattice. Progress of Theoretical Physics, 72:480, 1984.=20
463=20: K. Kaneko. Spatiotemporal intermittency in coupled map lattices.=20 Progress of Theoretical Physics, 74:1033, 1985.=20
464=20: K. Kaneko. Attractors, basin structures and information processing = in=20 cellular automata. In S. Wolfram, editor, Theory and applications = of=20 cellular automata. World Scientific, Singapore, 1986.=20
465=20: K. Kaneko. Lyapunov analysis and information flow in coupled map = lattices.=20 Physica, 23D:436, 1986.=20
466=20: K. Kaneko. Phenomenology and characterization of coupled map = lattices. In=20 Dynamical Systems and Singular Phenomena, Singapore, 1986. = World=20 Scientific.=20
467=20: K. Kaneko. Pattern dynamics in spatiotemporal chaos. Physica = D,=20 34:1, 1989.=20
468=20: K. Kaneko. Spatiotemporal chaos in one- and two-dimensional = coupled map=20 lattices. Physica D, 35, 1989.=20
469=20: B. K Kar, A Gupta, and P Pal. On explicit expressions in additive = cellular=20 automata theory. Information sciences, 72(1 / 2):83, August = 1993.=20
470=20: J. Kari. Decision problems concerning cellular automata. = PhD=20 thesis, University of Turku (Finland), 1990.=20
471=20: J. Kari. Reversability of 2D cellular automata is undecidable.=20 Physica, D 45:379-385, 1990.=20
472=20: J. Kari. Cryptosystems based on reversible cellular automata.=20 preprint, April 1992.=20
473=20: J. Kari. Reversibility and surjectivity problems of cellular = automata.=20 Journal of Computer and Systems Sciences, 48:149-182, 1994.=20
474=20: J. Kari. Rice's theorem for the limit set of cellular automata.=20 Theoretical Computer Science, 127(2):229-254, 1994.=20
475=20: J. Kari. Representation of reversible cellular automata with block = permutations. Mathematical Systems Theory, 29(1):47-61, 1996. =
476=20: Jarkko Kari. The nilpotency problem of one-dimensional cellular = automata.=20 Siam journal on computing, 21(3):571, June 1992.=20
477=20: Saul Kato. A discrete artificial organic chemistry and search for=20 autocatalysis. In John R. Koza, editor, Artificial Life at = Stanford=20 1994, pages 54-63. Stanford Bookstore, Stanford, California, = 94305-3079=20 USA, June 1994.=20
478=20: H. Katona. A transitive closure algorithm for a 16-state = cellprocessor. In=20 G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the = 4th=20 International Workshop on Parallel Processing by Cellular Automata and = Arrays, pages 285-290. LNCS 342. Springer, October 1988.=20
479=20: S. A Kauffman. Metabolic stability and epigenisis in randomly = constructed=20 genetic nets. J. Theoretical Biology, 22:437-467, 1969.=20
480=20: S. A Kauffman. Emergent properties in random complex systems. = Physica=20 D, 10:146-156, 1984.=20
481=20: Yasuo Kawahara. Existence of the characteristic numbers associated = with=20 cellular automata with local transition rule 90. Bulletin of = informatics=20 and cybernetics, 24(3 / 4):121, March 1991.=20
482=20: Lemont B Kier and Chao-Kun Cheng. A cellular automata model of = water.=20 Journal of chemical information and computer sci, 34(3):647, = May=20 1994.=20
483=20: S. Kim and R. McCloskey. A characterization of constant-time CA=20 computation. Physica D, 45:404, 1990.=20
484=20: T. R Kirkpatrick and M. H Ernest. Kinetic theory for lattice-gas = cellular=20 automata. Physical Review A, 44(12):8051, 1991.=20
485=20: Knackstedt, Muhammad Sahimi, and Derek Y. C Chan. = Cellular-automata=20 calculation of frequency-dependent permeability of porous media. = Physical=20 Review E, 47(4):2593, April 1993.=20
486=20: Kojiro Kobayashi. The firing squad synchronization problem for=20 two-dimensional arrays. Information and Control, 34:177-197, = 1977.=20
487=20: Youichi Kobuchi and Hidenosuki Nishio. Some regular state sets in = the=20 system of one-dimensional iterative automata. Information = Sciences,=20 5:199-216, 1973.=20
488=20: Peter Kochevar. Frontiers of rendering: The lunatic fringe. In=20 SIGGRAPH '91 Frontiers in Rendering course notes. July 1991. = 3D=20 cellular automata.=20
489=20: Peter Kochevar. Global illumination in voxel environments: An = excursion in=20 massively parallel computation. In ACM SIGGRAPH '91 Course Notes - = Frontiers in Rendering. July 1991. 3D cellular automata.=20
490=20: Peter Kochevar. A simple light simulation algorithm for massively = parallel=20 machines. In SIGGRAPH '91 Frontiers in Rendering course = notes. July=20 1991. 3D cellular automata.=20
491=20: Zvi Kohavi. Switching and Finite Automata Theory. = McGraw-Hill=20 Book Company, New York, 1978. ISBN 0-07-035310-7.=20
492=20: G. A Kohring. Calculations of drag coefficients via hydrodynamic = cellular=20 automata. Journal de physique, 2(3):265, March 1992.=20
493=20: G. A Kohring. The cellular automata approach to simulating fluid = flows in=20 porous media. Physica A, 186(1 / 2):97, 1992.=20
494=20: G. A Kohring. An efficient hydrodynamic cellular automata for = simulating=20 fluids with large viscosities. Journal of Statistical = Physics, 66(3 /=20 4):1177, February 1992.=20
495=20: G. A Kohring. Towards the classification of all boolean cellular = automata.=20 Physica A, 182(3):320, 1992.=20
496=20: Tamotsu Kohyama. Cluster growth in particle-conserving cellular = automata.=20 Journal of Statistical Physics, 63(3 / 4):637, May 1991.=20
497=20: A. N. Kolmogorov. Foundations of the Theory of = Probability.=20 Chelsea Publishing Company, D New York, 1950.=20
498=20: K Kometer, G Zandler, and P Vogl. Cellular automata simulation of=20 stationary and transient high-field transport in submicron si and gaas = devices. Semiconductor science and technology, 7(3B):559, = March 1992.=20
499=20: X. P. Kong and E. G. D. Cohen. Diffusion and propagation in = triangular=20 lorentz lattice gas cellular automata. Journal of Statistical=20 Physics, 62(3 / 4):737, 1991.=20
500=20: I Korec. The 3x + 1 problem, generalized pascal triangles and = cellular=20 automata. Mathematica Slovaca, 42(5):547, 1992.=20
501=20: E. K=F6rner, M. Gross, A. Richter, and H. Shimizu. Control of = sensory=20 processing - a hypothesis on and simulation of the architecture of an=20 elementary cortical processor. In G. Wolf, T. Legendi, and U. = Schendel,=20 editors, Proceedings of the 4th International Workshop on Parallel = Processing by Cellular Automata and Arrays, pages 291-297. LNCS = 342.=20 Springer, October 1988.=20
502=20: V. E. Kotov. Modular highly-parallel computation and = architectures. In G.=20 Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th = International Workshop on Parallel Processing by Cellular Automata and = Arrays, pages 147-156. LNCS 342. Springer, October 1988.=20
503=20: John R. Koza. Discovery of rewrite rules in lindenmayer systems = and state=20 transition rules in cellular automata via genetic programming. In=20 Symposium on Pattern Formation (SPF-93), Claremont, California, = USA,=20 1993.=20
504=20: K. B. Krohn and J. L. Rhodes. Algebraic theory of machines. In=20 Mathematical Theory of Automata, pages 341-384. Polytechnic = Press,=20 Brooklyn, New York, 1963.=20
505=20: Krystian Kubica. The cellular automata for lipid membranes. = Applied=20 Mathematics and Computation, 63(2 / 3):187, July 1994.=20
506=20: Krystian Kubica. Cellular automata studies of cholesterol effects = on=20 gramicidin ion conductivity. Applied Mathematics and = Computation,=20 64(2 / 3):101, September 1994.=20
507=20: Krystian Kubica and Janina Kuczera. An application of cellular = automata to=20 model a lipid membrane. Applied Mathematics and Computation,=20 39(1):49, 1990.=20
508=20: Satoru Kumamoto, Nobito Yamamoto, and Masaya Nohmi. On dynamical = behavior=20 of gauss-seidel type finite cellular automata. Memoirs of the = Faculty of=20 Science, Kyusyu Univer, 47(1):15, March 1993.=20
509=20: M. Kunde. Bounds for 1-selection and related problems on grids of=20 processors. In G. Wolf, T. Legendi, and U. Schendel, editors, = Proceedings=20 of the 4th International Workshop on Parallel Processing by Cellular = Automata=20 and Arrays, pages 298-307. LNCS 342. Springer, October 1988.=20
510=20: Anthony J. C. Ladd and Daan Frenkel. Dissipative hydrodynamic = interactions=20 via lattice-gas cellular automata. Physics of fluids.A, = 2(11):1921,=20 1990.=20
511=20: Scott Robert Ladd. C++ Simulations and Cellular Automata/Book = and=20 Disk. M and T BOOKS, 1995. ISBN: 1558514473.=20
512=20: C. G. Langton. Self-reproduction in cellular automata. Physica = D,=20 10(1-2):135-144, 1984.
Details of a simple self-reproducing CA=20 configuration.=20
513=20: C. G. Langton. Self-reproduction in cellular automata. Physica = D,=20 10:135-144, 1984.=20
514=20: C. G. Langton. Studying artificial life with cellular automata.=20 Physica D, 22:120-149, 1986.
A preliminary = investigation of=20 the potential of CA for supporting life.=20
515=20: C. G. Langton. Virtual state machines in cellular automata. = Complex=20 Systems, 1:257-271, 1987.
Discussion of the importance of=20 propagating structures in CA. Contains example of a Turing machine = implemented=20 on the model of protein synthesis using propagating structures.=20
516=20: C. G. Langton. Computation at the edge of chaos. Physica = D, 42,=20 1990.=20
517=20: Christopher G. Langton. Artificial Life. Addison-Wesley, = Redwood=20 City, CA, 1989.=20
518=20: Christopher G. Langton and et al. Artificial Life II.=20 Addison-Wesley, Reading, MA, 1990.=20
519=20: John W. Layman. Dynamics of multicellular automata with unbounded = memory.=20 Complex Systems, 6(4):315-332, August 1992.=20
520=20: Fung F. Lee, Michael J. Flynn, and Martin Morf. A VLSI = architecture for=20 the FCHC isometric lattice gas model. Technical Report CSL-TR-90-426, = Stanford=20 University, April 1990. price ($5.24).=20
521=20: Fung F. Lee, Michael J. Flynn, and Martin Morf. A VLSI = ARCHITECTURE FOR=20 THE FCHC ISOMETRIC LATTICE GAS MODEL. Technical Report = STAN//CSL-TR-90-426,=20 Stanford University, Computer Systems Laboratory, April 1990. = [Adminitrivia=20 V1/Prg/19941108].=20
522=20: Hyen Yeal Lee and Yasuo Kawahara. On dynamical behaviors of = cellular=20 automata CA-60. Bulletin of informatics and cybernetics, 25(1 = /=20 2):21, March 1992.=20
523=20: Y. C. Lee, S. Qian, R. D. Jones, C. W. Barnes, G. W. Flake, M. K.=20 O'Rourke, K. Lee, H. H. Chen, G. Z. Sun, Y. Q. Zhang, D. Chen, and G. = L.=20 Giles. Adaptive stochastic cellular automata: applications. = Physica,=20 D, 1990.=20
524=20: T. Legendi, D. Parkinson, R. Vollman, and G. Wolf, editors. = Parallel=20 Processing by Cellular Automata and Arrays. North-Holland, 1986.=20
525=20: T. Legendi, D. Parkinson, R. Vollmar, and G. Wolf. Parallel = Processing=20 by Cellular Automata and Arrays (Parcella '86, Berlin, GDR, September = 9-11,=20 1986). North Holland, Amsterdam, 1986.=20
526=20: T. Legendi, D. Parkinson, R. Vollmar, and G. Wolf, editors. = Parcella=20 '86, Proceedings of the Third International Workshop on Parallel = Processing by=20 Cellular Automata and Arrays, Berlin, GDR, September 9-11, 1986.=20 Akademie-Verlag, Berlin.=20
527=20: Craig S Lent, Douglas Tougaw, and Wolfgang Porod. Bistable = saturation in=20 coupled quantum dots for quantum cellular automata. Applied = physics=20 Letters, 62(7):714, 1993.=20
528=20: Lenore Levine. Regular language invariance under one-dimensional = cellular=20 automaton rules. Complex Systems, 6:163-178, 1992.=20
529=20: W. Li. Pretty pictures generated by two-state five-neighbor = cellular=20 automata. Technical Report CCSR-88-15, Center for Complex Systems = Research,=20 University of Illinois, Champaign, IL, 1988.=20
530=20: W. Li and N. H. Packard. unknown. Complex Systems, 4:281, = 1990.=20
531=20: Wentian Li. Power spectra of regular languages and cellular = automata.=20 Complex Systems, 1:107-130, 1987.=20
532=20: Wentian Li. Complex patterns generated by next nearest neighbors = cellular=20 automata. Computers and Graphics, 13(4):531-537, 1989.=20
533=20: Wentian Li. On the relationship between complexity and entropy for = markov=20 chains snd regular languages. Complex Systems, 5:381-399, = 1991.=20
534=20: Wentian Li. Phenomenology of nonlocal cellular automata. = Journal of=20 Statistical Physics, 68(5 / 6):829, September 1992.=20
535=20: Wentian Li and Mats Nordahl. Transient behavior of cellular = automata rule=20 110. Physics Letters A, 166(5/6):335-339, 1992.=20
536=20: Wentian Li and Norman Packard. The structure of the elementary = cellular=20 automata rule space. Complex Systems, 4(3):281-297, June = 1990.=20
537=20: Wentian Li, Norman Packard, and Christopher G. Langton. Transition = phenomena in CA rule space. Physica D, 45:77, 1990.=20
538=20: Y.-L. Li and C.-W. Wu. Logic and fault simulation by cellular = automata. In=20 J.-P. Tual, editor, Proceedings of the European Conference on = Design=20 Automation, the European Test Conference, and the European Event in = ASIC=20 Design, pages 552-556. IEEE Computer Society Press, feb 1994.=20
539=20: S Lin, I Kumazawa, and J Wu. Optical chip implementation of = cellular=20 automata. Microwave and optical technology Letters, = 5(10):493,=20 September 1992.=20
540=20: Senmao Lin and Ruitang Liu. An incoherent multiple-imaging system = for=20 cellular automata. Journal of modern optics, 39(9):1863, = September=20 1992.=20
541=20: D. A. Lind. Applications of ergodic theory and sofic systems to = cellular=20 automata. Physica D, 10:36-44, 1984.=20
542=20: A. Lindenmayer and G. Rozenberg, editors. Automata, Languages, = Development. North-Holland, Amsterdam, 1976.=20
543=20: Lindgren. Errata and changes: ``correlations and random = information in=20 cellular automata''. Complex Systems, 1, 1987.=20
544=20: Kristian Lindgren. Evolutionary phenomena in simple dynamics. In=20 Christopher G. Langton, Charles Taylor, J. Doyne Farmer, and Steen = Rasmussen,=20 editors, Artificial Life II, volume 10 of Proceedings = volume in=20 the Santa Fe Institute studies in the science of Complexity, = pages=20 295-312, Redwood City, CA, 1992. Addison-Wesley.=20
545=20: Kristian Lindgren and Mats G. Nordahl. Universal computation in = simple=20 one-dimensional cellular automata. Complex Systems, = 4(3):299-318,=20 June 1990.=20
546=20: Kristian Lindren and Mats G. Nordahl. Complexity measures and = cellular=20 automata. Complex Systems, 2(4):409-440, August 1988.=20
547=20: B Litow and Ph Dumas. Additive cellular automata and algebraic = series.=20 Theoretical computer science, 119(2):345, 1993.=20
548=20: S. N. Coppersmith. P. B. Littlewood and P. Sibani. Cellular = automata and=20 complex dynamics of driven elastic media. In Bailey, D. H, Bj{}rstad, = P. E,=20 Gilbert, J. E, Mascagni, Michael V., Schreiber, R. S, Simon, H. D, = Torczon, V.=20 J, Watson, and L. T, editors, Proceedings of the 27th Conference = on=20 Parallel Processing for Scientific Computing, pages 187-192. SIAM = Press,=20 1995.=20
549=20: G. G. Lorentz. Bernstein Polynomials, 1953.=20
550=20: Erik D. Lumer and Gr=E9goire Nicolis. Synchronous versus = asynchronous=20 dynamics in spatially distributed systems. Physica D, = 71:440-452,=20 1994.=20
551=20: M. Mizumoto, J. Toyoda, and K. Tanaka. Some Considerations on = Fuzzy=20 Automata. Journal of Computer and Systems Sciences, = 3:409-422, 1969.=20
552=20: Antonio Machi and Filippo Mignosi. Garden of eden configurations = for=20 cellular automata on cayley graphs of groups. SIAM journal on = discrete=20 mathematics, 6(1):44, February 1993.=20
553=20: M Machtey and P. Young. An introduction to the general theory = of=20 algorithms. Elsevier North Holland, 1978.=20
554=20: A. B. MacIsaac, D. L Hunter, and M. J. Corsten. Determinism and=20 thermodynamics: Ising cellular automata. Physical Review.A.,=20 43(6):3190, 1991.=20
555=20: B. F. Madore and W. L Freedman. Self-organizing structures. = American=20 Scientist, 75:252-259, 1987.=20
556=20: Barry F. Madore and Wendy L. Freedman. Computer simulations of the = belousov-zhabotinsky reaction. Science, 222:615-616, 1983.=20
557=20: D. G. Maeder and M. Droz. 'cellular automata and monte-carlo = simulation=20 for a mesoscopic model of martensitic transformations. Materials = science=20 forum, 56 / 58:119, 1990.=20
558=20: Ch. Maes and S. B. Shlosman. Ergodicity of probabilistic cellular=20 automata: A constructive criterion. Communications in Mathematical = Physics, 135(2):233, 1991.=20
559=20: M. Mahajan and K. Krithivasan. Relativised cellular automata and=20 complexity classes. In S. Biswas and K. V. Nori, editors, = Proceedings of=20 Foundations of Software Technology and Theoretical Computer = Science,=20 pages 172-185. LNCS 560. Springer, December 1991.=20
560=20: M Mahajan and K Krithivasan. Some results on time varying and = relativised=20 cellular automata. International Journal of computer = mathematics,=20 43(1 / 2):21, 1992.=20
561=20: M. A Mainster. Cellular automata: Retinal cells, circulation and = patterns.=20 Eye, 6 p 4:420, 1992.=20
562=20: D Makawiec. Chaos in networks of two-dimensional homogenous = cellular=20 automata. Physica A, 172(3):291, April 1991.=20
563=20: Ranjit Makkuni. A pixelated design medium. In Tsiyasu L. Kunii, = editor,=20 Advanced Computer Graphics (Proceedings of Computer Graphics Tokyo = '86), pages 180-202. Springer-Verlag, 1986.=20
564=20: Ranjit Makkuni. A pixelated design medium. In Tsiyasu L. Kunii, = editor,=20 Advanced Computer Graphics (Proceedings of Computer Graphics Tokyo = '86), pages 180-202. Springer-Verlag, 1986.=20
565=20: Ranjit Makkuni. Pixelated structures as a compositional medium. = The=20 Visual Computer, 2(4):243-254, August 1986.=20
566=20: D Makowiec. Remarks on the rule classification of symmetric=20 two-dimensional homogeneous cellular automata. Physica A, = 176(3):430,=20 September 1991.=20
567=20: D Makowiec. The dynamics of homogeneous and symmetric cellular = automata=20 via description of neighbourhood distribution. Journal of Physics = A,=20 25(6):1441, 1992.=20
568=20: D Makowiec. Probabilistic approach to the dynamics of = deterministic=20 homogeneous and symmetric two-dimensional cellular automata. = Physica=20 A, 199(2):299, 1993.=20
569=20: Danuta Makowiec. The classification of homogenous and symmetric = cellular=20 automata. Acta physica Polonica,Series B, 23(4):299, April = 1992.=20
570=20: G. G Malinstskii and M. S Shakaeva. On cellular automata modelling = oscillatory chemical reactions on a surface. Soviet physics, = Doklady,=20 37(8):401, August 1992.=20
571=20: V. A Malyshev. Large systems. Problems of information=20 transmission, 27(2):87, April 1991. Breakdown of Conservation = Laws in=20 Stochastic Cellular Automata.=20
572=20: S. S. Manna and D. Stauffer. Systematics of transitions of = square-lattice=20 cellular automata. Physica A., 162(2):176, 1990.=20
573=20: P. Manneville, N. Boccara, G. Vichniac, and R. Bidaux. = Cellular=20 automata and the modeling of complex physical systems. Springer, = Berlin,=20 1989.=20
574=20: Margolus and Toffoli. Cellular automata machines. Complex=20 Systems, 1, 1987.=20
575=20: N. Margolus. Physics-like models of computation. Physica = D,=20 10:81-95, 1984.
Discussion of reversible cellular automata = illustrated=20 by an implementation of Fredkin's Billiard-Ball model of = computation.=20
576=20: N. Margolus, T. Toffoli, and G. Vichnise. Cellular automata = supercomputers=20 for fluid dynamics modeling. Technical Report MIT/LCS/TM-296, MIT = Laboratory=20 for Computer Science, December 1985. Price: $4.00.=20
577=20: N. H. Margolus. Physics And Computation. Ph.D. thesis, = MIT=20 Laboratory for Computer Science, March 1988.=20
578=20: N. H. Margolus. Physics and computation. Technical Report = MIT/LCS/TR-415,=20 MIT Laboratory for Computer Science, March 1988.=20
579=20: A. P Marriott, Ph Tsalides, and P. J Hicks. VLSI implementation of = smart=20 imaging system using two-dimensional cellular automata. IEE=20 proceedings.G,Circuits, devices and syst, 138(5):582, October = 1991.=20
580=20: B. Martin. A universal cellular automaton in quasi-linear time and = its=20 S-m-n form. Theoretical Computer Science, (123):199-237, = 1994.=20
581=20: O. Martin. Critical dynamics of 1-D irreversible systems. = Physica=20 D, 45:345, 1990.=20
582=20: O. Martin, A. Odlyzko, and S. Wolfram. Algebraic properties of = cellular=20 automata. Communications in Mathematical Physics, 93:219, = 1984. An=20 early paper on algebraic properties of CA.=20
583=20: Maruoka and Kimura. Injectivity and surjectivity of parallel maps = for=20 cellular automata. Journal of Computer and Systems Sciences, = 18,=20 1979.=20
584=20: A. Maruoka and M. Kimura. Conditions for injectivity of global = maps for=20 tessallation automata. Information and Control, 32:158-162, = 1976.=20
585=20: Akira Maruoka and Masayuki Kimura. Injectivity and surjectivity of = parallel maps for cellular automata. Journal of Computer and = System=20 Sciences, 18(1):47-64, February 1979.=20
586=20: William K Mason. Art form cellular automata and symmetrized = dot-patterns.=20 Computers and Graphics, 16(4):439, 1992.=20
587=20: William K. Mason. Art from cellular automata and symmetrized = dot-patterns.=20 Computers and Graphics, 16(4):439-442, 1992.=20
588=20: J. Mazoyer. A six-state minimal time solution to the firing squad=20 synchronization problem. Theoretical Computer Science, = 50(2):183-240,=20 1987.=20
589=20: J Mazoyer and N Reimen. A linear speed-up theorem for cellular = automata.=20 Theoretical computer science, 101(1):59, July 1992.=20
590=20: J. F McCarthy. Flow through arrays of cylinders: Lattice gas = cellular=20 automata simulations. Physics of fluids, 6(2):435, February = 1994.=20
591=20: J. F McCarthy. Lattice gas cellular automata method for flow in = the=20 interdendritic region. Acta metallurgica et materialia, = 42(5):1573,=20 May 1994.=20
592=20: W. S. McCulloch and W. Pitts. A logical calculus of the ideas = immanent in=20 nervous activity. Bulletin of Mathematical Biophysics, = 5:115-133,=20 1943.=20
593=20: Hugh McEvoy and Jaap A. Kaandorp. On modelling = environmentally-sensitive=20 growth forms and cellular automata using multiset transformation. to = appear in=20 Fractals, 1995.=20
594=20: H. V. McIntosh. Wolfram's class IV automata and a good life. = Physica=20 D, 45:105, 1990.=20
595=20: Harold V. Mcintosh. Wolfram's class IV automata and a good life.=20 Physica D, 45:105-121, 1990.=20
596=20: Harold V. McIntosh. Linear cellular automata via de bruijn = diagrams.=20 preprint, May 1991.=20
597=20: Harold V. McIntosh. Reversible cellular automata. preprint, = January 1991.=20
598=20: W. Meier and O. Staffelbach. Analysis of pseudo random sequences = generated=20 by cellular automata. Proceedings of Eurocrypt '91, pages = 186-199,=20 1991.=20
599=20: W. Meier and O. Staffelbach. Analysis of pseudo random sequences = generated=20 by cellular automata. In D. W. Davies, editor, Proceedings of = Advances in=20 Cryptology (EUROCRYPT '91), pages 186-199. LNCS 547. Springer, = April=20 1991.=20
600=20: C. Meinel and P. Zienicke. Recursive design of communication = schemes for=20 parallel computation with R E L A C S. In G. Wolf, T. Legendi, and U.=20 Schendel, editors, Proceedings of the 4th International Workshop = on=20 Parallel Processing by Cellular Automata and Arrays, pages = 308-310. LNCS=20 342. Springer, October 1988.=20
601=20: Hans Meinhardt. The Algorithmic Beauty of Sea Shells. = Springer=20 Verlag, 1995. ISBN 3-540-67842-0, ISBN 0-387-57842-0.=20
602=20: Mikulecky. On configurations in cellular automata. In = Symposium on=20 Mathematical Foundations of Computer Science, 1974.=20
603=20: J. S. Miller. Molecular electronics? Advanced materials., = 2(12):601, 1990. Research News/Molecular Materials II Part C: In the = final=20 part of this article, the potential contributions of magnetic and=20 superconducting components to the goal of molecular electronics are = analyzed=20 as are alternative scenarios involving optically based computing, = neural=20 networks and cellular automata. An assessment of future targets is = given.=20
604=20: M. I. Miller, B. Roysam, K. R. Smith, and J. A. O'Sullivan. = Representing=20 and computing regular languages on massively parallel networks. = IEEE=20 Transactions on Neural Networks, 2(1):56-72, 1991.=20
605=20: G. Milne, P. Cockshott, G. McCaskill, and P. Barrie. Realising = massively=20 concurrent systems on the SPACE machine. In D. A. Buell and K. L. = Pocek,=20 editors, Proceedings of IEEE Workshop on FPGAs for Custom = Computing=20 Machines, pages 26-32, Napa, CA, April 1993.=20
606=20: George Milne, Paul Cockshott, George McCaskill, and Peter Barrie.=20 Realising massively concurrent systems on the SPACE machine. Technical = Report=20 HDV-29-93, Department of Computer Science, University of Strathclyde, = 1993.=20
607=20: John Milnor. On the entropy geometry of cellular automata. = Complex=20 Systems, 2(3):357-385, June 1988.=20
608=20: O Miramontes, R. V. Sole, and B. C Goodwin. Collective behaviour = of=20 random-activated mobile cellular automata. Physica D, 63(1 / = 2):145,=20 1993.=20
609=20: Eduardo Reck Miranda. Cellular automata music: An = interdisciplinary=20 project. Interface, 22(1):3, 1993.=20
610=20: S. Misra, A. K. Das, and Dipanwita Roy Chowdhury. Cellular = automata-theory=20 and applications. Journal of the Institution of Electronics and = Te,=20 36(3 / 4):251, 1990.=20
611=20: M. Mitchell, J. P. Crutchfield, and P. T. Hraber. Evolving = cellular=20 automata to perform computations. Physica D (submitted), = 1993.=20 available from ftp.santafe.edu /pub/Users/mm/sfi-93-11-071.part1.ps.Z = and=20 sfi-93-11-071.part2.ps.Z.=20
612=20: M. Mitchell, P. T. Hraber, and J. P. Crutchfield. Dynamic = computation, and=20 the ``edge of chaos'': A re-examination. In G. Cowan, D. Pines, and D. = Melzner, editors, Integrative Themes, Santa Fe Institute = Proceedings,=20 Volume 19, page (to appear), Reading, MA, 1993. Addison-Wesley. Santa = Fe=20 Institute Working Paper 93-06-040.=20
613=20: M. Mitchell, P. T. Hraber, and J. P. Crutchfield. revisiting the = egde of=20 chaos: Evolving cellular automata to perform computations. Complex = Systems, page (submitted), 1993. Santa Fe Institute Working Paper = 93-03-014.=20
614=20: E. N. Miya. Multiprocessor - distributed processing bibliography. = In=20 Proc. of the Entity-Relationship conference, North-Holland,=20 Karlsruhe, October 1992. Also published in/as: Computer = Architecture=20 News, ACM SIG Architecture, Vol.13 No.1, Mar.1985, pp.27-29.=20
615=20: Mizuno. A neural network model for pattern recognition. In = Proceedings=20 of the 3rd International Workshop on Parallel Processing by Cellular = Automata=20 and Arrays. North-Holland/Akademie-Verlag, 1986.=20
616=20: R. Monaco. Discrete Kinetic Theory, Lattice Gas Dynamics and=20 Foundations of Hydrodynamics. World Scientific, 1989.=20
617=20: Cristopher Moore. Non-abelian cellular automata. Technical report, = Santa=20 Fe Institute, 1996. ftp://ftp.santafe.edu/pub/moore/semi.ps.=20
618=20: Cristopher Moore. Quasi-linear cellular automata. Technical = report, Santa=20 Fe Institute, 1996. ftp://ftp.santafe.edu/pub/moore/quasi.ps.=20
619=20: Cristopher Moore and Arthur A. Drisko. Algebraic properties of the = block=20 transformation on cellular automata. Technical report, Santa Fe = Institute,=20 1996. ftp://ftp.santafe.edu/pub/moore/block.ps.=20
620=20: E. F. Moore. Machine models of self-reproduction. In A. W. Burks, = editor,=20 Essays on Cellular Automata, pages 187-203. University of = Illinois=20 Press, 1970.
Moore's proof of the existence of ``Garden of = Eden''=20 configurations in cellular automata: configurations which cannot occur = under=20 the action of a specific CA rule. Moore also provides a way around = Rosen's=20 paradox [].=20
621=20: Edward F. Moore. Gedanken experiments on sequential machines. In = C. E.=20 Shannon and John McCarthy, editors, Automata Studies. = Princeton=20 University Press, Princeton, New Jersey, 1956.=20
622=20: Edward F. Moore. Machine models of self reproduction. American = Mathematical Society, Proceedings of Symposia in Applied = Mathematics,=20 14:17-33, 1962.=20
623=20: Edward F. Moore. The firing squad synchronization problem. In = Edward F.=20 Moore, editor, Sequential Machines: Selected Papers, pages = 213-214.=20 Addison-Wesley, Reading, Massachussetts, 1964.=20
624=20: F. R. Moore and G. G. Langdon. A generalized firing squad problem. = Information and Control, 12:212-220, 1968.=20
625=20: K. Morita. A simple construction method of a reversible finite = automaton=20 out of fredkin gates, and its related model. Transactions of the=20 IEICE, E(6):978-984, June 1990.=20
626=20: K Morita. Computation-universality of one-dimensional one-way = reversible=20 cellular automata. Information Processing Letters, 42(6):325, = 1992.=20
627=20: K. Morita. Computation-universality of one-dimensional one-way = reversible=20 cellular automata. Information Processing Letters, = 42(6):325-??,=20 1992.=20
628=20: K. Morita and S. Ueno. Computation-universal models of = two-dimensional=20 16-state reversible automata. IEICE Trans. Inf. and Syst.,=20 E75-D(1):141-147, January 1992.=20
629=20: K. Morita and S Ueno. Parallel generation and parsing of array = languages=20 using reversible cellular automata. International Journal of = pattern=20 recognition and, 8(2):543, April 1994.=20
630=20: Kenichi Morita. Reversible simulation of one-dimensional = irreversible=20 cellular automata. Theoretical Computer Science, = 148(1):157-163,=20 1995. Note.=20
631=20: Kenichi Morita and Satoshi Ueno. Computation-universal models of=20 two-dimensional 16-state reversible cellular automata. IEICE = transactions=20 on information and systems, 75(1):141, January 1992.=20
632=20: Scott Morris. Games - the game of life. Omni, = 7(1):188-189,=20 October 1984.=20
633=20: Z. G. Mou. CAL: A cellular automata language. In Bailey, D. H, = Bj{}rstad,=20 P. E, Gilbert, J. E, Mascagni, Michael V., Schreiber, R. S, Simon, H. = D,=20 Torczon, V. J, Watson, and L. T, editors, Proceedings of the 27th=20 Conference on Parallel Processing for Scientific Computing, pages = 722-727. SIAM Press, 1995.=20
634=20: C. Moukarzel and N. Parga. On the evaluation of magnetisation = fluctuations=20 with Q2R cellular automata. Journal of Physics A, 22(8):943, = 1989.=20
635=20: Shahar Mozes. Tilings, substitution systems and dynamical systems=20 generated by them. Journal d'analyse math=E9matique, = 53:139-186, 1988.=20
636=20: Stefan C. Muller, Theo Plesser, and Benno Hess. The structure of = the core=20 of the spiral wave in the B-Z reaction. Science, 230:4726, = November=20 1985.=20
637=20: Stefan C. Muller, Theo Plesser, and Benno Hess. Threedimensional=20 representation of chemical gradients. Biophysical Chemistry, = February=20 1987.=20
638=20: James D. Murray. How the leopard gets its spots. Scientific=20 American, pages 62-69, March 1988.=20
639=20: A. Muscholl. On the complementation of B=FCchi asynchronous = cellular=20 automata. In Proceedings of the 21st International Colloquium on = Automata,=20 Languages and Programming (ICALP'94), Jerusalem (Israel) 1994, = Lecture=20 Notes in Computer Science. Springer, 1994.=20
640=20: J. Myczkowski. Parallel programming for cellular automata. = Technical=20 Report TR-16 CA89-3, Thinking Machines Corporation, 1989. (Appeared in = Cellular Automata and Modeling of Complex Physical Systems, P. = Manneville, N.=20 Boccara, G. Y.Vichniac, and R. Bidaux, eds. Berlin: = Springer-Verlag[1989]: pp.=20 118-129.).=20
641=20: Dale Myers. Nonrecursive tilings of the plane. II. The Journal = of=20 Symbolic Logic, 39:286-294, 1974.=20
642=20: J. Myhill. The converse to Moore's garden-of-Eden theorem. = Proceedings=20 of the American Mathematical Society, 14:685-686, 1963.=20
643=20: J. Myhill. The abstract theory of self-reproduction. In A. W. = Burks,=20 editor, Essays on Cellular Automata, pages 206-218. = University of=20 Illinois Press, 1970.
.=20
644=20: Toyoaki Naitoh, Matthieu H Ernst, and Martin A van der Hoef. = Extended mode=20 coupling and simulations in cellular-automata fluids. Physical = Review=20 A, 44(4):2484, 1991.=20
645=20: K. Nakamura. Asynchronous cellular automata and their = computational=20 ability. Systems, Computer, Control, 5:58-66, 1974.=20
646=20: S Nandi, B Vamsi, and S Chakraborty. Cellular automata as a BIST = structure=20 for testing CMOS circuits. IEE proceedings.e, computers and = digital=20 tech, 141(1):41, January 1994.=20
647=20: G Narkounskaia and D. L Turcotte. A cellular-automata, = slider-block model=20 for earthquakes-I demonstration of chaotic behaviour for a low-order = system.=20 Geophysical journal international, 111(2):250, November 1992. =
648=20: Masakazu Nasu. Local maps inducing surjective global maps of one=20 dimensional tesselation automata. Mathematical Systems = Theory,=20 11:327-351, 1978.=20
649=20: Masakazu Nasu. Indecomposable local maps of tesselation automata.=20 Mathematical Systems Theory, 13:81-93, 1979.=20
650=20: Masakazu Nasu. An interconnection of local maps inducing onto = global maps.=20 Discrete Applied Mathematics, 2:125-150, 1980.=20
651=20: Masakazu Nasu. Uniformly finite-to-one and onto extensions of=20 homomorphisms between strongly connected graphs. Discrete=20 Mathematics, 39:171-197, 1982.=20
652=20: Masakazu Nasu. Textile systems for endomorphisms and automorphisms = of the=20 shift. Memoirs of A.M.S, 1996.=20
653=20: Basem A. Nayfeh. Cellular automata for solving mazes. Dr. = Dobb's=20 Journal of Software Tools, 18(2):32-??, February 1993.=20
654=20: Mark D. Niemiec. Life algorithms. Byte, 4(1):90-97, 1979. =
655=20: Masaya Nohmi. On a polynomial representation of finite linear = cellular=20 automata. Bulletin of Informatics and Cybernetics, 24(3 / = 4):137,=20 March 1991.=20
656=20: Mats G. Nordahl. Formal languages and finite cellular automata.=20 Complex Systems, 3:63-78, 1989.=20
657=20: Martin A. Nowak and Robert M. May. Evolutionary games and spatial = chaos.=20 Nature, 359:826-829, 1992.=20
658=20: M. Oliphant. Evolving cooperation in the non-iterated prisoner's = dilemma.=20 In R Brooks and P. Maes, editors, Artificial Life IV. MIT = Press,=20 1994.=20
659=20: B. Ostrovsky, M.A. Smith, and Y. Bar-Yam. Applications of parallel = computing to biological problems. Ann. Rev. Biophys. Biomol. = Struct.,=20 24:239-67, 1995. uses Margolus dynamics to conserve mass and implement = excluded volume, or a novel two-space algorithm to do the same, = discusses=20 fine- vs. course-grain simulation issues.=20
660=20: B. J. Overeinder, P. M. A. Sloot, and L. O. Hertzberger. Time warp = on a=20 transputer platform: Pilot study with asynchronous cellular automata. = In M.=20 Valero, E. Onate, M. Jane, J. L. Larriba, and B. Suarez, editors, = Parallel=20 Computing and Transputer Applications, pages 1303-1312, = Amsterdam, 1992.=20 IOS Press.=20
661=20: Benno J. Overeinder and Peter M. A. Sloot. Application of time = warp to=20 parallel simulations with asynchronous cellular automata. In A. = Verbraeck and=20 E. J. H. Kerckhoffs, editors, European Simulation Symposium = 1993,=20 pages 397-402, Delft, The Netherlands, October 1993. Society for = Computer=20 Simulation International.=20
662=20: N. H. Packard. Adaptation toward the edge of chaos. In J. A. S. = Kelso, A.=20 J. Mandell, and M. F. Shlesinger, editors, Dynamic patterns in = complex=20 systems, pages 293-301. World Scientific, Singapore, 1988.=20
663=20: Norman H. Packard and Stephen Wolfram. Two-dimensional cellular = automata.=20 Journal of Statistical Physics, 38:901-946, 1985.=20
664=20: K. Palagyi. Solution of dense systems of linear equations using = cellular=20 processors. In G. Wolf, T. Legendi, and U. Schendel, editors, = Proceedings=20 of the 4th International Workshop on Parallel Processing by Cellular = Automata=20 and Arrays, pages 311-316. LNCS 342. Springer, October 1988.=20
665=20: R. Pandey. Cellular automata approach to interacting cellular = network=20 models for the dynamics of cell population in an early HIV infection.=20 Physica A, 179:442-470, 1991.=20
666=20: R. B. Pandey and D. Stauffer. Metastability with probabilistic = cellular=20 automata in an HIV infection. Journal of Statistical Physics, = 61(1 /=20 2):235, 1990.=20
667=20: T. S. Papatheodorou, M. J. Ablowitz, and Y. G. Saridakis. A rule = for fast=20 computation and analysis of soliton automata. Studies in Applied=20 Mathematics, 79:173-184, 1988.=20
668=20: T. S. Papatheodorou and .S. Fokas. Evolution theory, periodic = particles=20 and solitons in cellular automata. Studies in Applied Math,=20 80:165-182, 1989.=20
669=20: T. S. Papatheodorou and N. B. Tsantanis. Fast soliton automata. In = H.=20 Djidjev, editor, Optimal Algorithms, volume LNCS:401, pages = 41-47.=20 Springer, Berlin, 1989.=20
670=20: Parcella '90 - Proceedings on the V. International Workshop on = Parallel Processing on Cellular Automata and Arrays, Berlin, September = 17-21, volume 2. Akademie-Verlag, Berlin, 1990.=20
671=20: J. K. Park, K. Steiglitz, and W. P. Thurston. Soliton-like = behavior in=20 automata. Physica D, 19:423-432, 1986.=20
672=20: M. Payer. Finite state machine theory as a tool for construction = of=20 systolic arrays. In Pichler F. and Moreno-Diaz R., editors, = Computer Aided=20 Systems Theory - Eurocast 89, volume LNCS:410, pages 212-224, = Berlin,=20 1990. Springer-Verlag.=20
673=20: Pedersen. Decision problems for cellular automata and their = semigroups. In=20 Symposium on Mathematical Foundations of Computer Science, = 1992.=20
674=20: J. Pedersen. Decision problems for cellular automata and their = semigroups.=20 In I. M. Havel and V. Koubek, editors, Proceedings of MFCS '92.=20 Mathematical Foundations of Computer Science (MFCS '92), pages = 421-429.=20 LNCS 629. Springer, August 1992.=20
675=20: John Pedersen. Continuous transitions of cellular automata. = Complex=20 Systems, 4(6):653-665, December 1990.=20
676=20: John Pedersen. Cellular automata as algebraic systems. Complex = Systems, 6(3):237-250, June 1992.=20
677=20: A Perera, K. A Penson, and U Schultze. Long-time dynamics of=20 two-dimensional fluid binary mixture in cellular automata models.=20 Helvetica Physica Acta, 65(2 / 3):501, 1992.=20
678=20: Asher Peres. Reversible logic and quantum computers. Physical = Review=20 A, 32:3266-3276, 1985.=20
679=20: M. Perles, M. O. Rabin, , and E. Shamir. The theory of definite = automata.=20 IEEE Transactions on Electronic Computers, EC-12:233-243, = 1963.=20
680=20: Kenneth E. Perry. Abstract mathematical art. Byte, = (13):181-192,=20 dec 1986.=20
681=20: N. Petkov. Bumming order statistics on a bit-level systolic array. = In G.=20 Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th = International Workshop on Parallel Processing by Cellular Automata and = Arrays, pages 317-325. LNCS 342. Springer, October 1988.=20
682=20: Tsalides Ph., York T. A., and Thanailakis A. Pseudorandom number=20 generators for VLSI systems based on linear cellular automata. IEE = Proceedings-E, 138(4):241-249, July 1991. Besides random numbers=20 generation it contains a nice presentation of the rigorous methods of = analysis=20 of CA time evolution. The transition matrices and semigroup structures = for=20 global rules are used to describe state transition graphs of some CA.=20
683=20: L. B Di Pietro, A Melayah, and S Zaleski. Modeling water = infiltration in=20 unsaturated porous media by interacting lattice gas-cellular automata. = Water resources research, 30(10):2785, October 1994.=20
684=20: G. Pighizzini. About asynchronous cellular automata. Technical = Report=20 76/90, Dip. Scienze dell'Informazione, Universit=E0 di Milano, 1990.=20
685=20: Nicholas Pippenger. Symmetry in self-correcting cellular automata. = Journal of Computer and Systems Sciences, 49(1):83, August = 1994.=20
686=20: N. Pitsianis, Ph. Tsalides, G. L. Bleris, A. Thanailakis, and H. = C. Card.=20 Deterministic one-dimensional cellular automata. Journal of = Statistical=20 Physics, 56:99-112, 1989.=20
687=20: Tomaso Poggio and Federico Girosi. Continuous stochastic cellular = automata=20 that have a stationary distribution and no detailed balance. Technical = report,=20 Artificial Intelligence Laboratory, Massachusetts Institute of = Technology=20 (MIT), Cambridge, Massachusetts, December 1990.=20
688=20: Y Pomeau. Periodic behavior of cellular automata. Journal of=20 Statistical Physics, 70(5 / 6):1379, March 1993.=20
689=20: T. P=F6schel, W. Ebeling, and T. Boseniuk. Simulation of learning = networks.=20 In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of = the 4th=20 International Workshop on Parallel Processing by Cellular Automata and = Arrays, pages 332-339. LNCS 342. Springer, October 1988.=20
690=20: William Poundstone. The Recursive Universe. William = Morrow and=20 Company, New York, 1985. ISBN 0-688-03975-8.=20
691=20: The International Workshop on Parallel Processing by Cellular = Automata=20 - Abstracts. Central Institute of Cybernetics and = Informationprocesses of=20 Academy of Sciences of GDR, Research Group of Automata Theory of = Hungarian=20 Academy of Sciences, 1982.=20
692=20: Carmen P. C Prado and Zeev Olami. Inertia and break of = self-organized=20 criticality in sandpile cellular-automata models. Physical Review = A,=20 45(2):665, 1992.=20
693=20: W. Pries, A. Thanailakis, and H. C. Card. Group properties of = cellular=20 automata and VLSI applications. T- COMP, 35:1013-1024, 1986.=20
694=20: Priese. A note on asynchronous cellular automata. Journal of = Computer=20 and Systems Sciences, 17, 1978.=20
695=20: G. Pritsch and J. Volkert. Multiprocessor systems for large = numerical=20 applications. In G. Wolf, T. Legendi, and U. Schendel, editors,=20 Proceedings of the 4th International Workshop on Parallel = Processing by=20 Cellular Automata and Arrays, pages 266-273. LNCS 342. Springer, = October=20 1988.=20
696=20: M. A. Prunkin. Systolic array for eigenvalue of jacobi matrix. In = G. Wolf,=20 T. Legendi, and U. Schendel, editors, Proceedings of the 4th = International=20 Workshop on Parallel Processing by Cellular Automata and Arrays, = pages=20 274-284. LNCS 342. Springer, October 1988.=20
697=20: S. Qian, Y. C. Lee, R. D. Jones, C. W. Barnes, G. W. Flake, M. K.=20 O'Rourke, K. Lee, H. H. Chen, G. Z. Sun, Y. Q. Zhang, D. Chen, and C. = L.=20 Giles. Adaptive stochastic cellular automata: Theory. Phyisca = D, 666,=20 1990.=20
698=20: Hameroff S. R., J. E. Dayhoff, R. Lahoz-Beltra, A. V. Samsonovich, = and S.=20 Rasmussen. Conformational automata in the cytoskeleton. = Computer,=20 25(11):30-40, 1992.=20
699=20: Raghu Raghavan. Cellular automata in pattern recognition. = Information=20 sciences, 70(1 / 2):145, May 1993.=20
700=20: Anthony Ralston. De bruijn sequences-A model example of the = interaction of=20 discrete mathematics and computer science. Mathematics = Magazine,=20 55:131-143, 1982.=20
701=20: A Ramirez. Stochastic cellular automata with gibbsian invariant = measures.=20 IEEE transactions on information theory, 37(3 p 1):541, May = 1991.=20
702=20: S. Rasmussen and J.R. Smith. Lattice polymer automata. Ber. = Bunsenges.=20 Phys. Chem., 98(9):1185-1193, 1994. extension of LGA that uses=20 particle-interactions to implement excluded volume and polymeric = bonds. To=20 find, contact: VCH Verlagsgesellschaft mbH, D-69451 Weinheim Paper=20 0005-9021/94/0909-1185.=20
703=20: A. Norman Redlich. Supervised factorial learning. Neural=20 Computation, 6:750-766, 1994.=20
704=20: J. A. Reggia, H.-H. Chou, S. L. Armentrout, and Y. Peng. = Minimizing=20 complexity in cellular automata models of self-replication. In L. = Hunter, D.=20 Searls, and J. Shavlik, editors, Proceedings of the 1st = International=20 Conference on Intelligent Systems for Molecular Biology, pages = 337-344.=20 AAAI Press, July 1993.=20
705=20: James A. Reggia, Steven L. Armentrout, Hui-Hsien Chou, and Yun = Peng.=20 Simple systems that exhibit self-directed replication. = Science,=20 259:1282-1287, 1993.=20
706=20: Wolfgang Renz, Rudiger Westermann, and Wolfgang Kruger. = Interactive=20 visualization of three-dimensional cellular automata. Computers in = Physics, 8(5):550, September 1994.=20
707=20: Craig Reynolds. Flocks, herds, and schools: A distributed = behavioral=20 model. Proceedings of ACM Computer Graphics, 21(4):25-33, = July 1987.=20
708=20: D. Richardson. Tesselations with local transformations. = Journal of=20 Computer and Systems Sciences, 5:373-388, 1972.=20
709=20: D. Richardson. Tesselations with local transformations. = Journal of=20 Computer and Systems Sciences, 6:373-388, 1972.=20
710=20: M. Rickert, K. Nagel, M. Schreckenberg, and A. Latour. Two lane = traffic=20 simulations using cellular automats. to appear in: Physica A, = 1995.=20
711=20: R. M. Robinson. Undecidability and nonperiodicity for tilings of = the=20 plane. Inventiones Mathematicae, 12:177-209, 1971.=20
712=20: Robison. Fast computation of additive cellular automata. = Complex=20 Systems, 1, 1987.=20
713=20: T Rogers and C Want. Emulation and subshifts of finite type in = cellular=20 automata. Physica D, 70(4):396, 1994.=20
714=20: Z. R=F3ka. One-way cellular automata on cayley graphs. In Z. Esik, = editor,=20 Proceedings of Fundamentals of Computation Theory (FCT '93), = pages=20 406-417. LNCS 710. Springer, August 1993.=20
715=20: Zs. R=F3ka. One-way cellular automata on Cayley graphs (short = version). In=20 FCT'93, Lecture Notes in Computer Science. Springer Verlag, = August=20 1993.=20
716=20: Zs. R=F3ka. One-way cellular automata on Cayley graphs. = Theoretical=20 Computer Science, (to appear).=20
717=20: Zsuzsanna R=F3ka. One-way cellular automata on Cayley graphs.=20 Theoretical Computer Science, 132(1-2):259-290, 1994.=20
718=20: C. Rose. Rapid optimal scheduling for time-multiplex switches = using a=20 cellular automaton. IEEE trans. on commun., COM-37, = 5:500-509, 1989.=20
719=20: D. Rothman and S. Zaleski. lga review (?). Reviews of Modern=20 Physics, 66:1417, 1994.=20
720=20: Renata B Rybka, Marek Cieplak, and U D'Ortona. Cellular-automata = studies=20 of circular couette flows and choatic mixing. Physical Review = E,=20 48(2):757, August 1993.=20
721=20: Muhammad Sahimi. Flow phenomena in rocks: From continuum models to = fractals percolation, cellular automata, and simulated annealing. = Reviews=20 of modern physics, 65(4):1393, October 1993.=20
722=20: Eugene S. Santos. Maximin Automata. Information and = Control,=20 13:363-377, 1968.=20
723=20: T Sato. Decidability for some problems of linear cellular automata = over=20 finite commutative rings. Information processing Letters, = 46(3):151,=20 1993.=20
724=20: Tadakazu Sato. Group structured linear cellular automata over zm.=20 Journal of Computer and Systems Sciences, 49(1):18, August = 1994.=20
725=20: Tadakazu Sato and Namio Honda. Certain relations between = properties of=20 maps of tesselation automata. Journal of System and Computer=20 Sciences, 15:121-145, 1977.=20
726=20: Kazuhiro Satoh. Computer experiment on the complex behavior of a=20 two-dimensional cellular automaton as a phenomenological mpdel for an=20 ecosystem. Journal of the Physical Society of Japan,=20 58(10):3842-3856, 1989.=20
727=20: Kazuhiro Satoh. Single and multiarmed spiral patterns in a = cellular=20 automaton model for an ecosystem. Journal of the Physical Society = of=20 Japan, 59(12):4204-4207, 1990.=20
728=20: U. Schendel. Parallel computation and supercomputers and = applications. In=20 G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the = 4th=20 International Workshop on Parallel Processing by Cellular Automata and = Arrays, pages 157-176. LNCS 342. Springer, October 1988.=20
729=20: A. Schlijper. On some variational approximations in = two-dimensional=20 classical lattice systems. PhD thesis, University of Groningen, = The=20 Netherlands, 1985.=20
730=20: H. Schmeck and A. Dittrich. Given's rotation on an instruction = systolic=20 array. In G. Wolf, T. Legendi, and U. Schendel, editors, = Proceedings of=20 the 4th International Workshop on Parallel Processing by Cellular = Automata and=20 Arrays, pages 340-346. LNCS 342. Springer, October 1988.=20
731=20: H. Schnelle. CONCURRENT PARSING IN programmable LOGIC ARRAY (PLA-) = NETS -=20 PROBLEMS AND PROPOSALS. In 10th International Conference on = Computational=20 Linguistics, 22nd Annual Meeting of the Association for Computational=20 Linguistics, Proceedings of Coling 84. Palo Alto, California, = pages=20 150-153, Ruhr-Univ Bochum, Bochum, West Germany, 1984. Assoc for = Computational=20 Linguistics, Menlo Park, CA, USA.=20
732=20: Robert H Schonmann. On the behavior of some cellular automata = related to=20 bootstrap percolation. The Annals of probability, 20(1):174, = January=20 1992.=20
733=20: Schrandt and Ulam. On recursively defined geometrical objects and = patterns=20 of growth. In Essays on Cellular Automata, ed. Arthur W. Burks, = University=20 of Illinois Press, Urbana, Chicago, London. 1970.=20
734=20: R. G. Schrandt and S. M. Ulam. On patterns of growth of figures in = two=20 dimensions. Notices of the American Mathematical Society, = 7:642ff,=20 1960.
Early studies of pattern development in cellular = automata,=20 including competitions between two kinds of patterns. Reprinted in [118].=20
735=20: L. S. Schulman and P. E. Seiden. Statistical mechanics of a = dynamical=20 system based on conway's game of life. Journal of Statistical=20 Physics, pages 293-314, 1978.=20
736=20: R. Serra and G. Zanarini. Complex Systems and cognitive=20 processes. Springer-Verlag, 1990. see Chapter 3.=20
737=20: Friedhelm Seutter. CEPROL: A cellular programming language. = Parallel=20 Computing, 2(327-333):327-333, 1985.=20
738=20: Claude E. Shannon and John McCarthy. Annals of Mathematics Studies = #34.=20 Princeton University Press, Princeton, 1956. ISBN 0-691-07916-1.=20
739=20: M. A Shereshevsky. Ergodic properties of certain surjective = cellular=20 automata. Monatshefte fur Mathematik, 114(3 / 4):305, 1992.=20
740=20: M. A Shereshevsky. Lyapunov exponents for one-dimensional cellular = automata. Journal of nonlinear science, 2(1):1, 1992.=20
741=20: Bhavin Sheth, Prantik Nag, and Robert W. Hellwarth. Binary = addition on=20 cellular automata. Complex Systems, 5(5):479-486, October = 1991.=20
742=20: Bhavin Sheth, Prantik Nag, and Robert W. Hellwarth. Driver = mechanisms on=20 cellular automata. Complex Systems, 5(5):487-496, October = 1991.=20
743=20: M. Shirvani and T. D Rogers. On ergodic one-dimensional cellular = automata.=20 Communications in Mathematical Physics, 136(3):599, 1991.=20
744=20: H. Sieburg, X. McCutchan, X. Clay, X. Cabalerro, and X. Ostlund.=20 Simulation of HIV infection in artificial immune systems. Physica = D,=20 45:208-227, 1990.=20
745=20: Hans B. Sieburg and Oliver K. Clay. Cellular automata as algebraic = systems. Complex Systems, 5(6):575-602, December 1991.=20
746=20: Hans B. Sieburg and Oliver K. Clay. The cellular device machine=20 development system for modeling biology. Complex Systems, = pages=20 575-601, 1991.=20
747=20: Margaret L. Silbar. Computational tool or curiosity? = Mosaic,=20 19(2):44.=20
748=20: L. R. Da Silva, A. Hansen, and S. Roux. Spreading of damage in=20 deterministic cellular automata as a percolation problem. = Europhysics=20 Letters, 8(1):47, 1989.=20
749=20: Jonathan Silvertown, Senino Holtier, Jeff Johnson, and Pam Dale. = Cellular=20 automaton models of interspecific competition for space-the effect of = pattern=20 on process. Journal of Ecology, 80:527-534, 1992.=20
750=20: N. R. S Simons, G. E Bridges, and A. R Sebak. Cellular automata as = an=20 environment for simulating electromagnetic phenomena. IEEE = microwave and=20 guided wave Letters, 4(7):247, July 1994.=20
751=20: M. Sipper. Non-uniform cellular automata: Evolution in rule space = and=20 formation of complex structures. In Brooks, R. A, Maes, and Pattie, = editors,=20 Proceedings of the 4th International Workshop on the Synthesis and = Simulation of Living Systems , pages = 394-399.=20 MIT Press, July 1994.=20
752=20: M. Sipper. Quasi-uniform computation-universal cellular automata. = In=20 ECAL95: 3rd European Conference on Artificial Life, Granada, = Spain,=20 June 1995. Springer-Verlag.=20
753=20: M. Sipper. Studying artificial life using a simple, general = cellular=20 model. Artificial Life Journal, 2(1), 1995. The MIT Press, = Cambridge,=20 MA.=20
754=20: P. Siwak. Particles of parity rule recursive filtering constructed = by=20 means of particle edge automata. Technical report, unknown, 1992. = typescript.=20
755=20: P. Siwak. Introduction to filter automata theory. Studia z=20 Automatyki, T.XVIII:87-110, 1993.=20
756=20: M. M. Skolnick, S. Kim, and R. O'Bara. Morphological algorithms = for=20 computing non-planar point neighborhoods on cellular automata. pages = 106-111,=20 1988.=20
757=20: Sven Skyum. Confusion in the garden of eden. Proceedings of = the=20 American Mathematical Society, 50:332-336, 1975.=20
758=20: Smith. Cellular automata and formal languages. In IEEE = Symposium on=20 Foundations of Computer Science (FOCS), 1970.=20
759=20: Smith. Cellular automata complexity trade-offs. Information = and=20 Computation (formerly Information and Control), 18, 1971.=20
760=20: Smith. Real-time language recognition by one-dimensional cellular=20 automata. Journal of Computer and Systems Sciences, 1972.=20
761=20: III A. R. Smith. Cellular automata and formal languages. In = Proc. 11th=20 IEEE Symposium on Foundations of Computer Science (FOCS), pages = 216-224,=20 1970.=20
762=20: III A. R. Smith. Two-dimensional formal languages and pattern = recognition=20 by cellular automata. In Proc. 12th IEEE Symposium on Foundations = of=20 Computer Science (FOCS), pages 144-152, 1971.=20
763=20: M. A. Smith. Technical Report MIT/LCS/TR-615, MIT Laboratory for = Computer=20 Science.=20
764=20: M. A. Smith. Representations of geometrical and topological = quantities in=20 CA. Physica D, 45:271, 1990.=20
765=20: A. R. Smith III. Simple computation-universal cellular spaces.=20 JACM, 18(3):339-353, 1971.
Proof that 1D cellular = automata are=20 capable of supporting universal computation.=20
766=20: Alvy Ray Smith III. Cellular automata complexity trade-offs.=20 Information and Control, 18(5):466-482, June 1971.=20
767=20: R. Sole, D. Lopez, M. Ginovart, and J. Valls. Self-organized = criticality=20 in monte carlo simulated ecosystems. Physics Letters A, = 172:56, 1992.=20
768=20: J. A Somers. Direct simulation of fluid flow with cellular = automata and=20 the lattice-boltzmann equation. Applied scientific research, = 51(1 /=20 2):127, June 1993.=20
769=20: J. A. Somers and P. C. Rem. A parallel cellular automata = implementation on=20 a transputer network for the simulation of small scale fluid flow = experiments.=20 In G. A. van Zee and J. G. G. van de Vorst, editors, Proceedings = of the=20 Shell Conference on Parallel Computing, pages 116-126. LNCS 384.=20 Springer, June 1988.=20
770=20: Sommerhaider and van Westrhenen. Parallel language recognition in = constant=20 time by cellular automata. Acta Informatica, 19, 1983.=20
771=20: R. Sosic and Robert R. Johnson. Computational properties of=20 self-reproducing growing automata. BioSystems, to appear, = 1996. The=20 paper is available from: http://www.cit.gu.edu.au/ sosic/living.html=20 ftp://ftp.cit.gu.edu.au/pub/R.Sosic/biosystems95.ps.Z.=20
772=20: G. Spezzano and D. Talia. CARPET: A programming language for = parallel=20 cellular processing. In Proceedings 2nd Europ. School on PPE for = HPC,=20 pages 71-74, Aprile 1996.=20
773=20: A. Spik and D. W. Robinson. Investigation of the cellular automata = method=20 for phase unwrapping and its implementation of an array processor. = Optics=20 and lasers in engineering, 14(1):25, 1991.=20
774=20: P. S. Spirakis. Past parallel algorithms and the complexity of=20 parallelism. In G. Wolf, T. Legendi, and U. Schendel, editors, = Proceedings=20 of the 4th International Workshop on Parallel Processing by Cellular = Automata=20 and Arrays, pages 177-190. LNCS 342. Springer, October 1988.=20
775=20: Richard K. Squier. Efficient, scalable architectures for = lattice-gas=20 computations. Thesis TR-304-91, Department of Computer Science, = Princeton=20 University, June 1991.=20
776=20: Richard K. Squier and Ken Steiglitz. Programmable parallel = arithmetic in=20 cellular automata using a particle model. Technical Report TR-478-94,=20 Department of Computer Science, Princeton University, December 1994.=20
777=20: B Srisuchinwong, Ph Tsalides, and T. A York. VLSI implementation = of mod-p=20 multiplier using homomorphisms and hybird cellular automata. IEE=20 proceedings.E,Computers and digital tech, 139(6):486, November = 1992.=20
778=20: D. Stauffer. Classification of square-lattice cellular automata = with=20 respect to total magnetization. Journal of Physics A, = 23(24):5933,=20 1990.=20
779=20: D. Stauffer. Computer simulation of cellular automata. J. = Phys. A:=20 Math. Gen., 24:909-927, 1991.=20
780=20: D. Stauffer and R. Pandey. Immunologically motivated simulation of = cellular automata. Computers in Physics, 6:4:404-410, 1992.=20
781=20: D. Stauffer and G. Weisbuch. High-dimensional simulation of the=20 shape-space model for the immune system. Physica A, 180: = 1-2:42-52,=20 1992.=20
782=20: Tim Stefanini. The genetic coding of behavioral attributes in = cellular=20 automata. In John R. Koza, editor, Artificial Life at Stanford = 1994,=20 pages 172-180. Stanford Bookstore, Stanford, California, 94305-3079 = USA, June=20 1994.=20
783=20: K. Steiglitz, I. Kamal, and A. Watson. Embedding computation in=20 one-dimensional automata by phase coding solitons. IEEE = Transactions on=20 Computers, C-37:2:138-145, 1988.=20
784=20: Stein and Ulam. Nonlinear transformation studies on electronic = computers.=20 In Essays on Cellular Automata, ed. Arthur W. Burks, University of = Illinois Press, Urbana, Chicago, London. 1970.=20
785=20: John G Stevens, Ronald E Rosensweig, and A. E Cerkanowicz. = Transient and=20 cyclic behavior of cellular automata with null boundary conditions.=20 Journal of Statistical Physics, 73(1 / 2):159, October 1993.=20
786=20: P. N Stiles and I. S Glickstein. Highly parallelizable route = planner based=20 on cellular automata algorithms. Ibm journal of research and=20 development, 38(2):167, March 1994.=20
787=20: K. Sugihara, A. Okabe, and B. Boots. Spatial Tessellations: = Concepts=20 and Applications of Voronoi Diagrams. Wiley, 1992.=20
788=20: N Sukumar, B. M Deb, and H Singh. Electron charge and current = densities,=20 the geometric phase and cellular automata. Zeitschrift fur=20 Naturforschung.A,, 48(1 / 2):134, January 1993.=20
789=20: Sutner. The computational complexity of cellular automata.=20 Fundamentals (or Foundations) of Computation Theory, 7, 1989. =
790=20: Sutner. The sigma-game and cellular automata. The American=20 Mathematical Monthly, 97, 1990.=20
791=20: K. Sutner. The computational complexity of cellular automata. In = J.=20 Csirik, J. Demetrovics, and F. G=E9cseg, editors, Proceedings of = the=20 International Conference on Fundamentals of Computation Theory, = pages=20 451-459. LNCS 380. Springer, August 1989.=20
792=20: K. Sutner. Linear cellular automata and the garden-of-eden. = The=20 mathematical intelligencer., 11(2):49, 1989.=20
793=20: K. Sutner. Classifying circular CA. Physica D, 45:386, = 1990.=20
794=20: Klaus Sutner. De bruijin graphs and linear cellular automata. = Complex=20 Systems, 5(1):19-30, February 1991.=20
795=20: Klaus SUTNER. Linear Cellular Automata and their Fischer Automata. = Technical Report 93-46, RISC-Linz, Johannes Kepler University, Linz, = Austria,=20 1993.=20
796=20: K. Svozil. Constructive chaos by CA and possible sources of an = arrow of=20 time. Physica D, 45:420, 1990.=20
797=20: Michael Swaine. Programming paradigms. Dr. dobb's = journal,=20 18(12):107, November 1993.=20
798=20: Byorgy Szabo and Istvan Borsos. Evolution and extinction of = families in=20 cellular automata. Physical Review E, 49(6B):5900, June 1994. =
799=20: B Tadic. Dynamics of frustrated cellular automata. Journal of=20 non-crystalline solids, 172 / 174:501, September 1994.=20
800=20: D. Takahashi and J. Matsukidaira. On discrete soliton equations = related to=20 cellular automata. Physics Letters A, 209:184-188, 1995.=20
801=20: H. Takahashi. The maximum invariant set of an automaton system.=20 Information and Control, 32:307-354, 1976.=20
802=20: S. Takahashi. CA and multifractals:dimension spectra of linear CA. = Physica D, 45:36, 1990.=20
803=20: Satoshi Takahashi. Self-similarity of linear cellular automata.=20 Journal of Computer and Systems Sciences, 44(1):114, February = 1992.=20
804=20: S. Takesue. Relaxation properties of elementary reversible CA. = Physica=20 D, 45:278, 1990.=20
805=20: Shinji Takesue. Reversible cellular automata and statistical = mechanics.=20 Physical Review Letters, 59:2499-2502, 1987.=20
806=20: Shinji Takesue. Ergodic properties and thermodynamics behavior of=20 elementary reversible cellular automata. I. basic properties. = Journal of=20 Statistical Physics, 56(3):371, 1989.=20
807=20: P. Tamayo and H. Hartman. Cellular automata, reaction-diffusion = systems,=20 and the origin of life. In C. G. Langton, editor, Proceedings of = the=20 Interdisciplinary Workshop on the Synthesis and Simulation of Living = Systems=20 (ALIFE '87), pages 105-124. Santa Fe Institute Studies in the = Sciences of=20 Complexity 6. Addison-Wesley, September 1987.=20
808=20: S. S Tambe, V. K Jayaraman, and B. D Kulkarni. Cellular automata = modelling=20 of a surface catalytic reaction with eley-rideal step: the case of CO=20 oxidation. Chemical physics Letters, 225(4 / 6):303, 1994.=20
809=20: R. L. Buvel T.E. Ingerson. Structure in asynchronous cellular = automata.=20 Physica D, 1:59-68, 1984.=20
810=20: T. Tensi. Worst case analysis for reducing algorithms on = instruction=20 systolic arrays with simple instruction sets. In G. Wolf, T. Legendi, = and U.=20 Schendel, editors, Proceedings of the 4th International Workshop = on=20 Parallel Processing by Cellular Automata and Arrays, pages = 347-352. LNCS=20 342. Springer, October 1988.=20
811=20: V=E9ronique Terrier. Language not recognizable in real time by = one-way=20 cellular automata. Theoretical Computer Science, = 156(1-2):281-287,=20 1996.=20
812=20: Worsch Th. Komplexitatstheoretische untersuchungen an myopischen=20 polyautomaten. Technical report, TU Braunschweig, 1991. Dissertation.=20
813=20: D. Thalmann. A ``lifegame'' approach to surface modelling and = rendering.=20 The Visual Computer, 2(6):384-390, December 1986.=20
814=20: O Than and S Buttgenbach. Simulation of anisotropic chemical = etching of=20 crystalline silicon using a cellular automata model. Sensors and=20 actuators. part a, 45(1):85, October 1994.=20
815=20: J. Thatcher. Self-describing turing machines and self-reproducing = cellular=20 automata. In A. W. Burks, editor, Essays on Cellular = Automata, pages=20 103-131. University of Illinois Press, 1970.
.=20
816=20: J. Thatcher. Universality in the von Neumann cellular model. In A. = W.=20 Burks, editor, Essays on Cellular Automata, pages 132-186. = University=20 of Illinois Press, 1970.
.=20
817=20: T. Toffoli. Cellular Automata Mechanics. PhD thesis, The=20 University of Michigan, 1977.
Toffoli's demonstration of = reversible=20 universal computation.=20
818=20: T. Toffoli. Cellular automata mechanics. Technical Report 208, = Logic of=20 Computers Group, CCS Dept., The University of Michigan, November 1977. =
819=20: T. Toffoli. Cellular automata as an alternative to (rather than an = approximation of) differential equations in modeling physics. = Physica=20 D, 10, 1984.
An insightful discussion of the reasons for = and=20 against modeling physical systems with differential equations.=20
820=20: T. Toffoli and N. Margolus. Cellular Automata Machines - a New = Environment for Modeling. MIT Press, Cambridge, MA, 1986.=20
821=20: T. Toffoli and N. Margolus. Invertible cellular automata: a = review.=20 Physica, D 45:229-253, 1990.=20
822=20: Tommaso Toffoli. Computation and construction universality of = reversible=20 cellular automata. Journal of Computer and Systems Sciences,=20 15:213-231, 1977.=20
823=20: Tommaso Toffoli and Norman Margolus. Cellular Automata = Machines.=20 MIT Press, London, 1987.=20
824=20: Y. S Toh, M. J Nobes, and G Carter. A cellular automata simulation = study=20 of surface roughening resulting from multi-atom etch pit generation = during=20 sputtering. Nuclear instruments and methods in physics = researc, 67(1=20 / 4):586, April 1992.=20
825=20: M. Tomassini. The parallel genetic cellular automata: Application = to=20 global function optimization. In C. R. N. Steele R. F. Albrecht, = editor,=20 Proceedings of the International Conference on Artificial Neural = Nets and=20 Genetic Algorithms, pages 385-391. Springer, February 1993.=20
826=20: Toom. Monotonic binary cellular automata. Problems of = Information=20 Transmission (translated from Problemy Peredachi Informatsii = (Russian)),=20 12, 1976.=20
827=20: N. Toth. Self-checking processing elements in cellular arrays. In = G. Wolf,=20 T. Legendi, and U. Schendel, editors, Proceedings of the 4th = International=20 Workshop on Parallel Processing by Cellular Automata and Arrays, = pages=20 353-359. LNCS 342. Springer, October 1988.=20
828=20: P. Douglas Tougaw and Craig S Lent. Logical devices implemented = using=20 quantum cellular automata. Journal of applied physics, = 75(3):1818,=20 February 1994.=20
829=20: R. Trobec. Cellular diagnostic in parallel systems. In G. Wolf, T. = Legendi, and U. Schendel, editors, Proceedings of the 4th = International=20 Workshop on Parallel Processing by Cellular Automata and Arrays, = pages=20 360-365. LNCS 342. Springer, October 1988.=20
830=20: Ph. Tsalides. Cellular automata-based built-in self-test = structures for=20 VLSI systems. Electronics Letters, 26(17):1350, 1990.=20
831=20: C. J. Twining. The limiting behavior of non-cylindrical elementary = cellular automata. Complex Systems, 6(5):417-431, October = 1992.=20
832=20: C. J. Twining and P. M. Binder. Enumeration of limit cycles in=20 noncylindrical cellular automata. Journal of Statistical = Physics,=20 66:385-401, 1992.=20
833=20: P Tzionas, Ph Tsalides, and A Thanailakis. Cellular automata based = minimum=20 cost path estimation on binary maps. Electronics Letters,=20 28(17):1653, 1992.=20
834=20: P Tzionas, Ph Tsalides, and A Thanailakis. Design and VLSI = implementation=20 of a pattern classifier using a pseudo 2D cellular automata. IEE=20 proceedings.G,Circuits, devices and syst, 139(6):661, December = 1992.=20
835=20: P Tzionas, P Tsalidis, and A Thanailakis. Three-dimensional = minimum-cost=20 path planning using cellular automata architectures. Mobile = robots,=20 7:297, 1992.=20
836=20: D. Uhlig. Beliable networks for boolean functions with small = complexity.=20 In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of = the 4th=20 International Workshop on Parallel Processing by Cellular Automata and = Arrays, pages 366-371. LNCS 342. Springer, October 1988.=20
837=20: L. Uhr. Process-structured architectures to transform information = flowing=20 through. In G. Wolf, T. Legendi, and U. Schendel, editors, = Proceedings of=20 the 4th International Workshop on Parallel Processing by Cellular = Automata and=20 Arrays, pages 191-204. LNCS 342. Springer, October 1988.=20
838=20: S. M. Ulam. On some mathematical problems connected with patterns = of=20 growth of figures. Proceedings of Symposia in Applied = Mathematics,=20 14:215-224, 1962.
An early study on pattern development in = cellular=20 automata by the man who suggested CA's to von Neumann. Reprinted in [].=20
839=20: Umeo, Morita, and Sugata. Deterministic one-way simulation of = two-way=20 real-time cellular automata and its related problems. Information=20 Processing Letters, 14, 1982.=20
840=20: unknown, editor. Physics of Computation and Computational = models of=20 Physics, volume 21:3-4, 6-7, and 12, 1982.=20
841=20: unknown. Chris langton's cellular automaton (?). Mathematical=20 Intelligencer, 15(2):54, 1993.=20
842=20: J Urias. Arithmetic representations of cellular automata. = Physica=20 D, 68(3 / 4):437, 1993.=20
843=20: Terrier V. Real time recognition with cellular automata a = meaningful=20 example. Technical report, ENS Lyon, 1987. Rapport LIP-R-90-17.=20
844=20: Plamen PETROV <valentin@bgearn.bitnet>. Non-replicative = fredkin's=20 rules in homogeneous cellular spaces. Technical report, Faculty of = Mathematics=20 and Informatics, Sofia University, 1996. see=20 http:highz.as.arizona.eduvdivanovPlamen, mostly in Bulgarian.=20
845=20: M. A. van der Hoef and D. Frenkel. Long-time tails of the velocity = autocorrrelation function in two- and three-dimensional lattice-gas = cellular=20 automata: A test of mode-coupling theory. Physical Review A,=20 41(8):4277, 1990.=20
846=20: J van Sas, F Catthoor, and H De Man. Cellular automata based = deterministic=20 self-test strategies for programmable data paths. IEEE = Transactions on=20 Computer-aided design, 13(7):940, July 1994.=20
847=20: G. Vichniac. Simulating physics with cellular automata. = Physica=20 D, 10:96-116, 1984.=20
848=20: G. Vichniac. Boolean derivatives on CA. Physica D, 45:63, = 1990.=20
849=20: G. Vichniac, P. Tamayo, and H. Hartman. Annealed and quenched=20 inhomogeneous cellular automata. Journal of Statistical = Physics, 45,=20 1986.=20
850=20: J. D. Victor. What can automaton theory tell us about the brain?=20 Physica D, 45:205, 1990.=20
851=20: Paul Vitanyi. Physics and the new computation. In J.Wiedermann and = P.Hajek, editors, MFCS'95, LNCS 969, pages 106-128. Springer, = Berlin,=20 1995.=20
852=20: P. M. B. Vitayni. Sexually reproducing cellular automata. = Math.=20 Biosci., 18:23-54, 1973.
.=20
853=20: R. Vollmar. Basic research for cellular processing. In G. Wolf, T. = Legendi, and U. Schendel, editors, Proceedings of the 4th = International=20 Workshop on Parallel Processing by Cellular Automata and Arrays, = pages=20 205-222. LNCS 342. Springer, October 1988.=20
854=20: R. Vollmar and B. G. Teubner. Algorithmen in = Zellularautomaten.=20 Stuttgart, 1979.=20
855=20: B. Voorhees. Nearest neighbor CA over with=20 periodic boundary conditions. Physica D, 45:26, 1990.=20
856=20: B Voorhees. Predecessors of cellular automata states. I. additive=20 automata. Physica D, 68(2):283, October 1993.=20
857=20: B Voorhees. Predecessors of cellular automata states.II.pre-images = of=20 finite sequences. Physica D, 73(1 / 2):136, 1994.=20
858=20: B Voorhees and S Bradshaw. Predecessors of cellular automata=20 states.III.garden of eden classification of cellular automata. = Physica=20 D, 73(1 / 2):152, 1994.=20
859=20: Burton Voorhees. Division algorithm sic for cellular automata = rules.=20 Complex Systems, 4(6):587-597, December 1990.=20
860=20: Burton Voorhees. Geometry and arithmetic of a simple cellular = automaton.=20 Complex Systems, 5(2):169-182, April 1991.=20
861=20: Burton Voorhees. Determination of fixed points and shift cycles = for=20 nearest neighbor cellular automata. Journal of Statistical = Physics,=20 66(5 / 6):1397, March 1992.=20
862=20: Burton H. Voorhees. Computational Analysis of One-Dimensional = Cellular=20 Automata. World Scientific, 1996.=20
863=20: Ken-nosuke Wada, Yoshiko Wada, Hirofumi Doi, Shin-ichi Tanaka, and = Mitsuri=20 Furusawa. Evolutionary systems: Structures and functions. In = Proceedings=20 of IEEE International Conference on Evolutionary Computation = (ICEC-94), World=20 Congress on Computational Intelligence, pages 796-801, Orlando, = Florida,=20 USA, jun 1994. IEEE Computer Society Press, New York.=20
864=20: L. Wagner. Dependence of drag on a galilean invariance-breaking = parameter=20 in lattice-boltzmann flow simulations. Physical Review E, = 49:2115,=20 1994.=20
865=20: P. Wagner. Traffic simulations using cellular automata: comparison = with=20 reality. Traffic and Granular Flow, Conference Proceedings, = 1995.=20
866=20: Robert T. Wainwright. self, 1973. a quarterly newsletter with 11 = issues=20 published between March 1971 and September 1973.=20
867=20: Abraham. Waksman. An optimum solution to the firing squad = synchronization=20 problem. Information and Control, 9:66-78, 1966.=20
868=20: C. C. Walker. Attractor dominance patterns in sparsely connected = boolean=20 nets. Physica D, 45:441-451, 1990.=20
869=20: Hao Wang. Notes on a class of tiling problems. Fundamenta=20 Mathemastecae, 82, 1975.=20
870=20: John Watrous. On one-dimensional quantum cellular automata. In = 36th=20 Annual Symposium on Foundations of Computer Science, pages = 528-537,=20 Milwaukee, Wisconsin, 1995. IEEE.=20
871=20: W. G. Wee and K. S. Fu. A Formulation of Fuzzy Automata and its=20 Application as Model of Learning Systems. IEEE Transactions on = Systems,=20 Man, Cybernetics, 5:215-223, 1969.=20
872=20: J=F6rg R. Weimar. Spontaneous nucleation in a reactive lattice gas = automaton. In Stefan M=FCller and Theo Plesser, editors, = Spatio-temporal=20 organization in nonequilibrium systems, pages 266-269, Dortmund, = Germany,=20 1992. Projekt Verlag.=20
873=20: Jorg R Weimar and Jean-Pierre Boon. Class of cellular automata for = reaction-diffusion systems. Physical Review E, 49(2):1749, = February=20 1994.=20
874=20: J=F6rg R. Weimar and Jean-Pierre Boon. A new class of cellular = automata for=20 reaction-diffusion systems. Physical Review E, to appear, = 1994.=20
875=20: J=F6rg R. Weimar and Jean-Pierre Boon. New class of cellular = automata for=20 reaction-diffusion systems applied to the CIMA reaction. In A. = Lawniczak and=20 R. Kapral, editors, Lattice Gas Automata and Pattern = Formation,=20 Waterloo, Ont, Canada, 1994. Fields Institute.=20
876=20: J=F6rg R. Weimar, David Dab, Jean-Pierre Boon, and Sauro Succi. = Fluctuation=20 correlations in reaction-diffusion systems: Reactive lattice gas = automata=20 approach. Europhysics Letters, 20(7):627-632, 1992.=20
877=20: J=F6rg R. Weimar, John J. Tyson, and Layne T. Watson. Diffusion = and wave=20 propagation in cellular automaton models of excitable media. = Physica=20 D, 55:309-327, 1992.=20
878=20: J=F6rg R. Weimar, John J. Tyson, and Layne T. Watson. Third = generation=20 cellular automaton for modeling excitable media. Physica D,=20 55:328-339, 1992.=20
879=20: G=E9rard Weisbuch, Howard Gutowitz, and Guillemette = Duchateau-Nguyen.=20 Information contagion and the economics of pollution. Journal of = Economic=20 Behavior and Organization, in press, 1996.=20
880=20: Benjamin Weiss. Subshifts of finite type and sofic systems.=20 Monatshefte fuer Mathematik, 77:462-474, 1973.=20
881=20: R. White and G. Engelen. Urban system dynamics and cellular = automata:=20 Fractal structures between order and chaos. unknown, 1900.=20
882=20: R White and G Engelen. Cellular automata and fractal urban form: a = cellular modelling approach to the evolution of urban land-use = patterns.=20 Environment and planning, 25(8):1175, August 1993.=20
883=20: R. White, G. Engelen, and I. Uljee. Cellular automata modelling of = fractal=20 urban land use patterns: Forcasting change for planning applications.=20 unknown, 1900.=20
884=20: J. Wiedermann. Weak parallel machines: a new class of physically = feasible=20 parallel machine models. In I. M. Havel and V. Koubek, editors,=20 Proceedings of the 17th International Symposium Mathematical = Foundations=20 of Computer Science, pages 95-111. Springer-Verlag, 1992. LNCS = 629.=20
885=20: Norbert Wiener. Cybernetics. John Wiley and Company, New = York,=20 1948.=20
886=20: W. John Wilbur, David J. Lipman, and Shihab A. Shamma. On the = prediction=20 of local patterns in cellular automata. Physica D, = 19:397-410, 1986.=20
887=20: W. Wilhelmi. Parallel algorithms in image processing. In G. Wolf, = T.=20 Legendi, and U. Schendel, editors, Proceedings of the 4th = International=20 Workshop on Parallel Processing by Cellular Automata and Arrays, = pages=20 223-240. LNCS 342. Springer, October 1988.=20
888=20: Kelly P. Williams. Simplifications of a self-replication model.=20 Science, 261:925-925, 1993.=20
889=20: R. F. Williams. Classification of subshifts of finite type. = Annals of=20 Mathematics, 98:120-153, 1973.=20
890=20: Willson. Growth patterns of ordered cellular automata. Journal = of=20 Computer and Systems Sciences, 22, 1981.=20
891=20: Willson. Calculating growth rates and moments for additive = cellular=20 automata. Discrete Applied Mathematics and Combinatorial = Operations=20 Research and Computer Science, 35, 1992.=20
892=20: Stephen J. Willson. Growth rates and fractional dimensions in = cellular=20 automata. Physica D, 10:69-74, 1984.=20
893=20: Greg Wilson. The life and times of cellular automata. New=20 Scientist, pages 44-47, October 1988.=20
894=20: A. T. Winfree, E. M. Winfree, and H. Seifert. Organizing centers = in a=20 cellular excitable medium. Physica D, 17:109-115, 1985.=20
895=20: Arthur T. Winfree. Rotating chemical reactions. Scientific=20 American, pages 82-95, June 1974.=20
896=20: G. Wolf, T. Legendi, and U. Schendel, editors. Parcella '88,=20 Proceedings of the Fourth International Workshop on Parallel = Processing by=20 Cellular Automata and Arrays, Berlin, GDR, October 17-21, 1988.=20 Akademie-Verlag, Berlin.=20
897=20: G. Wolf, T. Legendi, and U. Schendel, editors. Proceedings of = the 4th=20 International Workshop on Parallel Processing by Cellular Automata and = Arrays. LNCS 342. Springer, October 1988.=20
898=20: S. Wolfram. Statistical mechanics of cellular automata. = Reviews of=20 Modern Physics, 55:601-644, 1983.
Important paper largely=20 responsible for the resurgence of interest in cellular automata.=20
899=20: S. Wolfram. Cellular automata as models of complexity. = Nature,=20 311(4):419-424, 1984.
A well written account of the manner in = which=20 complex dynamics can emerge from simple components.=20
900=20: S. Wolfram. Universality and complexity in cellular automata. = Physica=20 D, 10:1-35, 1984.
Identifies four qualitative classes of = CA=20 dynamics.=20
901=20: S. Wolfram, editor. Theory and Applications of Cellular = Automata.=20 World Scientific, Singapore, 1986.
Collection of papers on = CA's.=20 Contains an extensive bibliography.=20
902=20: Stephan Wolfram. Random sequence generation by cellular automata. = Adv.=20 Appl. Math, 7:123, 1984.=20
903=20: Stephan Wolfram. Cryptography with cellular automata. = Proceedings of=20 Crypto '85, pages 429-432, 1985.=20
904=20: Stephan Wolfram. undecidability and intractability in physics.=20 Physical Review Letters, 54:735, 1985.=20
905=20: Stephan Wolfram. Cellular Automata and Complexity: Collected=20 Papers. Addison-Wesley, 1994. revision of [901]=20 Paperback: ISBN 0-201-62664-0, Hardcover: ISBN 0-201-62716-7.=20
906=20: Stephen Wolfram. Computation theory of cellular automata.=20 Communications in Mathematical Physics, 96:15-57, 1984.=20
907=20: Stephen Wolfram. Cellular Automata and Complexity.=20 Addison-Wesley, 1994.=20
908=20: W. W. Wootters and C. G. Langton. Is there a sharp phase = transition for=20 deterministic CA? Physica D, 45:95, 1990.=20
909=20: Th. Worsch. Reducing parallelism in cellular automata. In=20 [submitted].=20
910=20: Lawrence E. Wright. Cellular Automata with Non-Working = Cells. PhD=20 thesis, Ann Arbor, 1976.=20
911=20: Andrew Wuensche. The ghost in the machine:basins of attraction of = random=20 boolean networks. Cognitive Science Research Paper 281, University = of=20 Sussex, 1993, 1993. to be published in Artificial Life III, Santa = Fe=20 Institute Studies in the Sciences of Complexity.=20
912=20: Andrew Wuensche and Mike Lesser. The Global Dynamics of = Cellular=20 Automata, volume Reference Vol 1 of Santa Fe Institute = Studies in the=20 Sciences of Complexity. Addison-Wesley, 1992. IBSN 0-201-55740-1. =
913=20: Yaku. Surjectivity of nondeterministic parallel maps induced by=20 nondeterministic cellular automata. Journal of Computer and = Systems=20 Sciences, 12, 1976.=20
914=20: Takeo Yaku. The constructibility of a configuration in a cellular=20 automaton. Journal of Computer and Systems Sciences, = 7:481-496, 1973.=20
915=20: Takeo Yaku. Inverse and injectivity of parallel relations induced = by=20 cellular automata. Proceedings of the American Mathematical = Society,=20 58:216-220, 1976.=20
916=20: Yamada and Imori. One step transformation of periodic sequences by = cellular automata. SIAM Journal on Computing, 1983.=20
917=20: Hisao Yamada and Masatosi Imori. One step transformation of = periodic=20 sequences by cellular automata. SIAM Journal on Computing,=20 12(3):539-550, August 1983.=20
918=20: J. G. Zabolitzky. Critical properties of rule 22 elementary = cellular=20 automata. Journal of Statistical Physics, 50:1255-1262, 1988. =
919=20: D. Zambrella and P. Grassberger. Complexity of forecasting in a = class of=20 simple models. Complex Systems, 2:269-303, 1988.=20
920=20: G Zandler, A Di Carlo, and K Kometer. A comparison of monte carlo = and=20 cellular automata approaches for semiconductor device simulation. = IEEE=20 electron device Letters, 14(2):80, February 1993.=20
921=20: C. J. Zarowski, R. D. McLeod, and H. C. Card. Primitive cellular = automata,=20 threshold decomposition, and ranked order operations. IEEE = Transactions on=20 Computers, 38(1):148, [1] 1989.=20
922=20: Bernard P. Zeigler. Discrete event models for cell space = simulation.=20 International Journal of Theoretical Physics, = 21(6/7):573-588, 1982.=20
923=20: S Zhang, D. M Miller, and J. C Muzio. Determination of minimal = cost=20 one-dimensional linear hybrid cellular automata. Electronics = Letters,=20 27(18):25, 1991.=20
924=20: Z. J. Zheng and A. J. Maeder. The conjugate classification of the = kernel=20 form of the hexagonal grid. In T. L. Kunii and Y Shinagawa 73-89, = editors,=20 Modern Geometric Computing for Visualization. = Springer-Verlag, 1992.=20
925=20: Z. J. Zheng and A. J. Maeder. The elementary equation of the = conjugate=20 transformation for hexagonal grid. In B. Falcidieno and T. L. Kunii, = editors,=20 Modeling in Computer Graphics, pages 21-42. Springer-Verlag, = 1993.=20
926=20: W. Zielonka. Safe executions of recognizable trace languages by=20 asynchronous automata. In A. R. Mayer et al., editors, Symposium = on=20 Logical Foundations of Computer Science, Logic at Botik '89,=20 Pereslavl-Zalessky (USSR) 1989, number 363 in LNCS, pages = 278-289.=20 SPRINGER, 1989.=20
927=20: K.-H. Zimmermann. Pipeline-automata - a model for acyclic systolic = systems. In G. Wolf, T. Legendi, and U. Schendel, editors, = Proceedings of=20 the 4th International Workshop on Parallel Processing by Cellular = Automata and=20 Arrays, pages 372-379. LNCS 342. Springer, October 1988.=20
928=20: K. Zygourakis and P. Markenscoff. Cellular automata modeling = isotropic=20 growth of clusters of arbitrary morphology and their application to = the study=20 of heterogeneous reacting systems. In J. Dongarra, K. Kennedy, P. = Messina, D.=20 C. Sorensen, and R. G. Voigt, editors, Proceedings of the 5th SIAM = Conference on Parallel Processing for Scientific Computing, pages = 382-387. SIAM, March 1991.

------=_NextPart_000_0000_01C71BB4.6722DDF0 Content-Type: image/jpeg Content-Transfer-Encoding: base64 Content-Location: http://cafaq.com/bg/bg.jpeg /9j/4AAQSkZJRgABAQEAWgBaAAD/2wBDACgcHiMeGSgjISMtKygwPGRBPDc3PHtYXUlkkYCZlo+A jIqgtObDoKrarYqMyP/L2u71////m8H////6/+b9//j/wAALCAEAAQABAREA/8QAFwABAQEBAAAA AAAAAAAAAAAAAAECBf/EACYQAQACAgICAwEAAgMBAAAAAAABESExQXFRYQISgZGh8CIyscH/2gAI AQEAAD8A68VxBzlqIwz9YibIEq1xHa5lNbzJMpcys/G+SogmatJ/5X/vlqqnG0mN3n0Rcy0lqHKV EaNdlTO5UnSdpMRdzMrF3nEKRR7TfIl5KKhopKiNnRN8GISL+Wz5TEa2cbWZUlNJufS1ACmxnXuW spXnMqYGejtekqS6W8ExMn1LtJmiMys/yEqtELiC1TRNRs48H6UCovSXmuF0lZuZWk7PwiBWZg7V JzOSZ4WI8pM+FjySlrXk2azOyrkkrJ6Nk7UOSsUJPVqJfBsS8qE40mxYKsqIEWqOT1ZecQTOUWwt nETN5bsIEib1GF/ynRXldIrPQvCdkWuISflnBC8mzQX4INhgQ2sRAoJM12ok3Ov6mtrEzuQwkyqY UqCfSExe5P8ABEmyBSUutBfg1uT7L2ozmZzo3OP1Y/oqTQzPiF9BBM0mZlqIrZM0lcyqG1ikx2LE oFLoomPCZv2utyXekn2t1+pHyisLdSajKe1tnpS1gwZSpJWhO1K8lRBSH/qwUlZWfBMJr/6VZc3U NFRMl5pJmkmJKyVYEwtKl5J8GiwuATM6XRsiihFhSkvNQkY3OWgtm84zK7RUuPKxUaTZdaM7kxEN JUQWGhKtpBQ3KV5VKzaZ3PC8FElGCojSdyRN6gkUxCRIWsGDsu1E5JBQSbn0TMR7LlL8Q0l+DslN zENe0kDggqk6XYAQqTJMhwGUqVuI0RBgo6KzcpMr2EdGoLuUmeFrydGiU6aBm1OwAgOTsOzelErI agxVrAJidEaCyr2qTAFBsCRJFAjO1pJjmyFNJvZsiKhZTYB2KJJZaWs/ItJkMkKGBSwEmPt0UEFX GSsppSzknCby0kobK8FUk56WYzhFxBZZ6VUnJQAdFGoxmUzuVzO8QERShSTH9JJTan+Eu1OSvBVb JrkKNHKiYW0ic0sifpM1C4SVRbD9LIkEqoSvK4OVQTDUCKCdFeZTpQEVTBpOCJxOFABLKDCVY0IE yWFXtUkzZadl3oKtYqIDgq9mlsBJkA6Ckn+qSk4XaifaP1UmaTMro7TM+oXEGTSXq5a4En0VXsuU vNQs2kRQTJtc2RQtVoSZpNrcLMpM+yPEaJRSCoMSnRH9WpSFj2aFSI87OCZChFrBiFESfUrVxSVP BXlY2SqEyFZsqCbvBE5ragUix7EmaVBK8rg2VSpETzs4TS/FZSFRIjysoVc20zH8KzmViMYilSVj 2GkuyxU6UBmp5aEqyiZhYScFnYJiC2oOMJEUFqJfBOsp0UuwuLpUzeCZUSwsmJnkilOGf1aVEqLW CYvZXg/bSpXoqpLIgryFc0ok1GoM1k4RSZKJqMyn2aScaTU1O1xpaATFKnJYuEvFhUF4wleZVUst UVMF2VkyT8SI5XlJmtkTMzrHlKreZWS40qTRmdlwtsx6Wg2qTXJlYgSaTWlE2V5kzPS6Lo3K4kZv 5f7+NJMJrSxIkxM7waioIiZnK1Sdr0l/1aMKlRZclxyfa4OzBZQtJ+FXswug2bigKTQblRLspLua hdG4McKJRi0+2ahayYhMzK6SfS3xEBgiuCe0i/LUpEEzUeS85LtUk6I+PsUZxC3+dm+C/CXcH2rU WZnhZmIjMszPiF/65+S8Wk5xqD5fFJmI9tRdk4guLqNkzW5iC7zEL3IJ1CRHlbg7UxKTczXCmIT7 XNP/2Q== ------=_NextPart_000_0000_01C71BB4.6722DDF0 Content-Type: text/css; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Content-Location: http://cafaq.com/style/sheet.css BODY { PADDING-RIGHT: 0px; PADDING-LEFT: 0px; PADDING-BOTTOM: 0px; MARGIN: = 10px; COLOR: #000000; PADDING-TOP: 0px } A:link { COLOR: #0000ff } A:visited { COLOR: #000080 } A:active { COLOR: #800000 } A:hover { COLOR: #008000 } ------=_NextPart_000_0000_01C71BB4.6722DDF0--