Скачать 333.7 Kb.
Zsuzsanna Róka. One-way cellular automata on Cayley graphs. Theoretical Computer Science, 132(1-2):259-290, 1994.
C. Rose. Rapid optimal scheduling for time-multiplex switches using a cellular automaton. IEEE trans. on commun., COM-37, 5:500-509, 1989.
D. Rothman and S. Zaleski. lga review (?). Reviews of Modern Physics, 66:1417, 1994.
Renata B Rybka, Marek Cieplak, and U D'Ortona. Cellular-automata studies of circular couette flows and choatic mixing. Physical Review E, 48(2):757, August 1993.
Muhammad Sahimi. Flow phenomena in rocks: From continuum models to fractals percolation, cellular automata, and simulated annealing. Reviews of modern physics, 65(4):1393, October 1993.
Eugene S. Santos. Maximin Automata. Information and Control, 13:363-377, 1968.
T Sato. Decidability for some problems of linear cellular automata over finite commutative rings. Information processing Letters, 46(3):151, 1993.
Tadakazu Sato. Group structured linear cellular automata over zm. Journal of Computer and Systems Sciences, 49(1):18, August 1994.
Tadakazu Sato and Namio Honda. Certain relations between properties of maps of tesselation automata. Journal of System and Computer Sciences, 15:121-145, 1977.
Kazuhiro Satoh. Computer experiment on the complex behavior of a two-dimensional cellular automaton as a phenomenological mpdel for an ecosystem. Journal of the Physical Society of Japan, 58(10):3842-3856, 1989.
Kazuhiro Satoh. Single and multiarmed spiral patterns in a cellular automaton model for an ecosystem. Journal of the Physical Society of Japan, 59(12):4204-4207, 1990.
U. Schendel. Parallel computation and supercomputers and applications. In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, pages 157-176. LNCS 342. Springer, October 1988.
A. Schlijper. On some variational approximations in two-dimensional classical lattice systems. PhD thesis, University of Groningen, The Netherlands, 1985.
H. Schmeck and A. Dittrich. Given's rotation on an instruction systolic array. In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, pages 340-346. LNCS 342. Springer, October 1988.
H. Schnelle. CONCURRENT PARSING IN programmable LOGIC ARRAY (PLA-) NETS - PROBLEMS AND PROPOSALS. In 10th International Conference on Computational Linguistics, 22nd Annual Meeting of the Association for Computational Linguistics, Proceedings of Coling 84. Palo Alto, California, pages 150-153, Ruhr-Univ Bochum, Bochum, West Germany, 1984. Assoc for Computational Linguistics, Menlo Park, CA, USA.
Robert H Schonmann. On the behavior of some cellular automata related to bootstrap percolation. The Annals of probability, 20(1):174, January 1992.
Schrandt and Ulam. On recursively defined geometrical objects and patterns of growth. In Essays on Cellular Automata, ed. Arthur W. Burks, University of Illinois Press, Urbana, Chicago, London. 1970.
R. G. Schrandt and S. M. Ulam. On patterns of growth of figures in two dimensions. Notices of the American Mathematical Society, 7:642ff, 1960.
Early studies of pattern development in cellular automata, including competitions between two kinds of patterns. Reprinted in .
L. S. Schulman and P. E. Seiden. Statistical mechanics of a dynamical system based on conway's game of life. Journal of Statistical Physics, pages 293-314, 1978.
R. Serra and G. Zanarini. Complex Systems and cognitive processes. Springer-Verlag, 1990. see Chapter 3.
Friedhelm Seutter. CEPROL: A cellular programming language. Parallel Computing, 2(327-333):327-333, 1985.
Claude E. Shannon and John McCarthy. Annals of Mathematics Studies #34. Princeton University Press, Princeton, 1956. ISBN 0-691-07916-1.
M. A Shereshevsky. Ergodic properties of certain surjective cellular automata. Monatshefte fur Mathematik, 114(3 / 4):305, 1992.
M. A Shereshevsky. Lyapunov exponents for one-dimensional cellular automata. Journal of nonlinear science, 2(1):1, 1992.
Bhavin Sheth, Prantik Nag, and Robert W. Hellwarth. Binary addition on cellular automata. Complex Systems, 5(5):479-486, October 1991.
Bhavin Sheth, Prantik Nag, and Robert W. Hellwarth. Driver mechanisms on cellular automata. Complex Systems, 5(5):487-496, October 1991.
M. Shirvani and T. D Rogers. On ergodic one-dimensional cellular automata. Communications in Mathematical Physics, 136(3):599, 1991.
H. Sieburg, X. McCutchan, X. Clay, X. Cabalerro, and X. Ostlund. Simulation of HIV infection in artificial immune systems. Physica D, 45:208-227, 1990.
Hans B. Sieburg and Oliver K. Clay. Cellular automata as algebraic systems. Complex Systems, 5(6):575-602, December 1991.
Hans B. Sieburg and Oliver K. Clay. The cellular device machine development system for modeling biology. Complex Systems, pages 575-601, 1991.
Margaret L. Silbar. Computational tool or curiosity? Mosaic, 19(2):44.
L. R. Da Silva, A. Hansen, and S. Roux. Spreading of damage in deterministic cellular automata as a percolation problem. Europhysics Letters, 8(1):47, 1989.
Jonathan Silvertown, Senino Holtier, Jeff Johnson, and Pam Dale. Cellular automaton models of interspecific competition for space-the effect of pattern on process. Journal of Ecology, 80:527-534, 1992.
N. R. S Simons, G. E Bridges, and A. R Sebak. Cellular automata as an environment for simulating electromagnetic phenomena. IEEE microwave and guided wave Letters, 4(7):247, July 1994.
M. Sipper. Non-uniform cellular automata: Evolution in rule space and formation of complex structures. In Brooks, R. A, Maes, and Pattie, editors, Proceedings of the 4th International Workshop on the Synthesis and Simulation of Living Systems , pages 394-399. MIT Press, July 1994.
M. Sipper. Quasi-uniform computation-universal cellular automata. In ECAL95: 3rd European Conference on Artificial Life, Granada, Spain, June 1995. Springer-Verlag.
M. Sipper. Studying artificial life using a simple, general cellular model. Artificial Life Journal, 2(1), 1995. The MIT Press, Cambridge, MA.
P. Siwak. Particles of parity rule recursive filtering constructed by means of particle edge automata. Technical report, unknown, 1992. typescript.
P. Siwak. Introduction to filter automata theory. Studia z Automatyki, T.XVIII:87-110, 1993.
M. M. Skolnick, S. Kim, and R. O'Bara. Morphological algorithms for computing non-planar point neighborhoods on cellular automata. pages 106-111, 1988.
Sven Skyum. Confusion in the garden of eden. Proceedings of the American Mathematical Society, 50:332-336, 1975.
Smith. Cellular automata and formal languages. In IEEE Symposium on Foundations of Computer Science (FOCS), 1970.
Smith. Cellular automata complexity trade-offs. Information and Computation (formerly Information and Control), 18, 1971.
Smith. Real-time language recognition by one-dimensional cellular automata. Journal of Computer and Systems Sciences, 1972.
III A. R. Smith. Cellular automata and formal languages. In Proc. 11th IEEE Symposium on Foundations of Computer Science (FOCS), pages 216-224, 1970.
III A. R. Smith. Two-dimensional formal languages and pattern recognition by cellular automata. In Proc. 12th IEEE Symposium on Foundations of Computer Science (FOCS), pages 144-152, 1971.
M. A. Smith. Technical Report MIT/LCS/TR-615, MIT Laboratory for Computer Science.
M. A. Smith. Representations of geometrical and topological quantities in CA. Physica D, 45:271, 1990.
A. R. Smith III. Simple computation-universal cellular spaces. JACM, 18(3):339-353, 1971.
Proof that 1D cellular automata are capable of supporting universal computation.
Alvy Ray Smith III. Cellular automata complexity trade-offs. Information and Control, 18(5):466-482, June 1971.
R. Sole, D. Lopez, M. Ginovart, and J. Valls. Self-organized criticality in monte carlo simulated ecosystems. Physics Letters A, 172:56, 1992.
J. A Somers. Direct simulation of fluid flow with cellular automata and the lattice-boltzmann equation. Applied scientific research, 51(1 / 2):127, June 1993.
J. A. Somers and P. C. Rem. A parallel cellular automata implementation on a transputer network for the simulation of small scale fluid flow experiments. In G. A. van Zee and J. G. G. van de Vorst, editors, Proceedings of the Shell Conference on Parallel Computing, pages 116-126. LNCS 384. Springer, June 1988.
Sommerhaider and van Westrhenen. Parallel language recognition in constant time by cellular automata. Acta Informatica, 19, 1983.
R. Sosic and Robert R. Johnson. Computational properties of self-reproducing growing automata. BioSystems, to appear, 1996. The paper is available from: http://www.cit.gu.edu.au/ sosic/living.html ftp://ftp.cit.gu.edu.au/pub/R.Sosic/biosystems95.ps.Z.
G. Spezzano and D. Talia. CARPET: A programming language for parallel cellular processing. In Proceedings 2nd Europ. School on PPE for HPC, pages 71-74, Aprile 1996.
A. Spik and D. W. Robinson. Investigation of the cellular automata method for phase unwrapping and its implementation of an array processor. Optics and lasers in engineering, 14(1):25, 1991.
P. S. Spirakis. Past parallel algorithms and the complexity of parallelism. In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, pages 177-190. LNCS 342. Springer, October 1988.
Richard K. Squier. Efficient, scalable architectures for lattice-gas computations. Thesis TR-304-91, Department of Computer Science, Princeton University, June 1991.
Richard K. Squier and Ken Steiglitz. Programmable parallel arithmetic in cellular automata using a particle model. Technical Report TR-478-94, Department of Computer Science, Princeton University, December 1994.
B Srisuchinwong, Ph Tsalides, and T. A York. VLSI implementation of mod-p multiplier using homomorphisms and hybird cellular automata. IEE proceedings.E,Computers and digital tech, 139(6):486, November 1992.
D. Stauffer. Classification of square-lattice cellular automata with respect to total magnetization. Journal of Physics A, 23(24):5933, 1990.
D. Stauffer. Computer simulation of cellular automata. J. Phys. A: Math. Gen., 24:909-927, 1991.
D. Stauffer and R. Pandey. Immunologically motivated simulation of cellular automata. Computers in Physics, 6:4:404-410, 1992.
D. Stauffer and G. Weisbuch. High-dimensional simulation of the shape-space model for the immune system. Physica A, 180: 1-2:42-52, 1992.
Tim Stefanini. The genetic coding of behavioral attributes in cellular automata. In John R. Koza, editor, Artificial Life at Stanford 1994, pages 172-180. Stanford Bookstore, Stanford, California, 94305-3079 USA, June 1994.
K. Steiglitz, I. Kamal, and A. Watson. Embedding computation in one-dimensional automata by phase coding solitons. IEEE Transactions on Computers, C-37:2:138-145, 1988.
Stein and Ulam. Nonlinear transformation studies on electronic computers. In Essays on Cellular Automata, ed. Arthur W. Burks, University of Illinois Press, Urbana, Chicago, London. 1970.
John G Stevens, Ronald E Rosensweig, and A. E Cerkanowicz. Transient and cyclic behavior of cellular automata with null boundary conditions. Journal of Statistical Physics, 73(1 / 2):159, October 1993.
P. N Stiles and I. S Glickstein. Highly parallelizable route planner based on cellular automata algorithms. Ibm journal of research and development, 38(2):167, March 1994.
K. Sugihara, A. Okabe, and B. Boots. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley, 1992.
N Sukumar, B. M Deb, and H Singh. Electron charge and current densities, the geometric phase and cellular automata. Zeitschrift fur Naturforschung.A,, 48(1 / 2):134, January 1993.
Sutner. The computational complexity of cellular automata. Fundamentals (or Foundations) of Computation Theory, 7, 1989.
Sutner. The sigma-game and cellular automata. The American Mathematical Monthly, 97, 1990.
K. Sutner. The computational complexity of cellular automata. In J. Csirik, J. Demetrovics, and F. Gécseg, editors, Proceedings of the International Conference on Fundamentals of Computation Theory, pages 451-459. LNCS 380. Springer, August 1989.
K. Sutner. Linear cellular automata and the garden-of-eden. The mathematical intelligencer., 11(2):49, 1989.
K. Sutner. Classifying circular CA. Physica D, 45:386, 1990.
Klaus Sutner. De bruijin graphs and linear cellular automata. Complex Systems, 5(1):19-30, February 1991.
Klaus SUTNER. Linear Cellular Automata and their Fischer Automata. Technical Report 93-46, RISC-Linz, Johannes Kepler University, Linz, Austria, 1993.
K. Svozil. Constructive chaos by CA and possible sources of an arrow of time. Physica D, 45:420, 1990.
Michael Swaine. Programming paradigms. Dr. dobb's journal, 18(12):107, November 1993.
Byorgy Szabo and Istvan Borsos. Evolution and extinction of families in cellular automata. Physical Review E, 49(6B):5900, June 1994.
B Tadic. Dynamics of frustrated cellular automata. Journal of non-crystalline solids, 172 / 174:501, September 1994.
D. Takahashi and J. Matsukidaira. On discrete soliton equations related to cellular automata. Physics Letters A, 209:184-188, 1995.
H. Takahashi. The maximum invariant set of an automaton system. Information and Control, 32:307-354, 1976.
S. Takahashi. CA and multifractals:dimension spectra of linear CA. Physica D, 45:36, 1990.
Satoshi Takahashi. Self-similarity of linear cellular automata. Journal of Computer and Systems Sciences, 44(1):114, February 1992.
S. Takesue. Relaxation properties of elementary reversible CA. Physica D, 45:278, 1990.
Shinji Takesue. Reversible cellular automata and statistical mechanics. Physical Review Letters, 59:2499-2502, 1987.
Shinji Takesue. Ergodic properties and thermodynamics behavior of elementary reversible cellular automata. I. basic properties. Journal of Statistical Physics, 56(3):371, 1989.
P. Tamayo and H. Hartman. Cellular automata, reaction-diffusion systems, and the origin of life. In C. G. Langton, editor, Proceedings of the Interdisciplinary Workshop on the Synthesis and Simulation of Living Systems (ALIFE '87), pages 105-124. Santa Fe Institute Studies in the Sciences of Complexity 6. Addison-Wesley, September 1987.
S. S Tambe, V. K Jayaraman, and B. D Kulkarni. Cellular automata modelling of a surface catalytic reaction with eley-rideal step: the case of CO oxidation. Chemical physics Letters, 225(4 / 6):303, 1994.
R. L. Buvel T.E. Ingerson. Structure in asynchronous cellular automata. Physica D, 1:59-68, 1984.
T. Tensi. Worst case analysis for reducing algorithms on instruction systolic arrays with simple instruction sets. In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, pages 347-352. LNCS 342. Springer, October 1988.
Véronique Terrier. Language not recognizable in real time by one-way cellular automata. Theoretical Computer Science, 156(1-2):281-287, 1996.
Worsch Th. Komplexitatstheoretische untersuchungen an myopischen polyautomaten. Technical report, TU Braunschweig, 1991. Dissertation.
D. Thalmann. A ``lifegame'' approach to surface modelling and rendering. The Visual Computer, 2(6):384-390, December 1986.
O Than and S Buttgenbach. Simulation of anisotropic chemical etching of crystalline silicon using a cellular automata model. Sensors and actuators. part a, 45(1):85, October 1994.
J. Thatcher. Self-describing turing machines and self-reproducing cellular automata. In A. W. Burks, editor, Essays on Cellular Automata, pages 103-131. University of Illinois Press, 1970.
J. Thatcher. Universality in the von Neumann cellular model. In A. W. Burks, editor, Essays on Cellular Automata, pages 132-186. University of Illinois Press, 1970.
T. Toffoli. Cellular Automata Mechanics. PhD thesis, The University of Michigan, 1977.
Toffoli's demonstration of reversible universal computation.
T. Toffoli. Cellular automata mechanics. Technical Report 208, Logic of Computers Group, CCS Dept., The University of Michigan, November 1977.
T. Toffoli. Cellular automata as an alternative to (rather than an approximation of) differential equations in modeling physics. Physica D, 10, 1984.
An insightful discussion of the reasons for and against modeling physical systems with differential equations.
T. Toffoli and N. Margolus. Cellular Automata Machines - a New Environment for Modeling. MIT Press, Cambridge, MA, 1986.
T. Toffoli and N. Margolus. Invertible cellular automata: a review. Physica, D 45:229-253, 1990.
Tommaso Toffoli. Computation and construction universality of reversible cellular automata. Journal of Computer and Systems Sciences, 15:213-231, 1977.
Tommaso Toffoli and Norman Margolus. Cellular Automata Machines. MIT Press, London, 1987.
Y. S Toh, M. J Nobes, and G Carter. A cellular automata simulation study of surface roughening resulting from multi-atom etch pit generation during sputtering. Nuclear instruments and methods in physics researc, 67(1 / 4):586, April 1992.
M. Tomassini. The parallel genetic cellular automata: Application to global function optimization. In C. R. N. Steele R. F. Albrecht, editor, Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, pages 385-391. Springer, February 1993.
Toom. Monotonic binary cellular automata. Problems of Information Transmission (translated from Problemy Peredachi Informatsii (Russian)), 12, 1976.
N. Toth. Self-checking processing elements in cellular arrays. In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, pages 353-359. LNCS 342. Springer, October 1988.
P. Douglas Tougaw and Craig S Lent. Logical devices implemented using quantum cellular automata. Journal of applied physics, 75(3):1818, February 1994.
R. Trobec. Cellular diagnostic in parallel 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 360-365. LNCS 342. Springer, October 1988.
Ph. Tsalides. Cellular automata-based built-in self-test structures for VLSI systems. Electronics Letters, 26(17):1350, 1990.
C. J. Twining. The limiting behavior of non-cylindrical elementary cellular automata. Complex Systems, 6(5):417-431, October 1992.
C. J. Twining and P. M. Binder. Enumeration of limit cycles in noncylindrical cellular automata. Journal of Statistical Physics, 66:385-401, 1992.
P Tzionas, Ph Tsalides, and A Thanailakis. Cellular automata based minimum cost path estimation on binary maps. Electronics Letters, 28(17):1653, 1992.
P Tzionas, Ph Tsalides, and A Thanailakis. Design and VLSI implementation of a pattern classifier using a pseudo 2D cellular automata. IEE proceedings.G,Circuits, devices and syst, 139(6):661, December 1992.
P Tzionas, P Tsalidis, and A Thanailakis. Three-dimensional minimum-cost path planning using cellular automata architectures. Mobile robots, 7:297, 1992.
D. Uhlig. Beliable networks for boolean functions with small complexity. In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, pages 366-371. LNCS 342. Springer, October 1988.
L. Uhr. Process-structured architectures to transform information flowing through. In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, pages 191-204. LNCS 342. Springer, October 1988.
S. M. Ulam. On some mathematical problems connected with patterns of growth of figures. Proceedings of Symposia in Applied Mathematics, 14:215-224, 1962.
An early study on pattern development in cellular automata by the man who suggested CA's to von Neumann. Reprinted in .
Umeo, Morita, and Sugata. Deterministic one-way simulation of two-way real-time cellular automata and its related problems. Information Processing Letters, 14, 1982.
unknown, editor. Physics of Computation and Computational models of Physics, volume 21:3-4, 6-7, and 12, 1982.
unknown. Chris langton's cellular automaton (?). Mathematical Intelligencer, 15(2):54, 1993.
J Urias. Arithmetic representations of cellular automata. Physica D, 68(3 / 4):437, 1993.
Terrier V. Real time recognition with cellular automata a meaningful example. Technical report, ENS Lyon, 1987. Rapport LIP-R-90-17.
M. A. van der Hoef and D. Frenkel. Long-time tails of the velocity autocorrrelation function in two- and three-dimensional lattice-gas cellular automata: A test of mode-coupling theory. Physical Review A, 41(8):4277, 1990.
J van Sas, F Catthoor, and H De Man. Cellular automata based deterministic self-test strategies for programmable data paths. IEEE Transactions on Computer-aided design, 13(7):940, July 1994.
G. Vichniac. Simulating physics with cellular automata. Physica D, 10:96-116, 1984.
G. Vichniac. Boolean derivatives on CA. Physica D, 45:63, 1990.
G. Vichniac, P. Tamayo, and H. Hartman. Annealed and quenched inhomogeneous cellular automata. Journal of Statistical Physics, 45, 1986.
J. D. Victor. What can automaton theory tell us about the brain? Physica D, 45:205, 1990.
Paul Vitanyi. Physics and the new computation. In J.Wiedermann and P.Hajek, editors, MFCS'95, LNCS 969, pages 106-128. Springer, Berlin, 1995.
P. M. B. Vitayni. Sexually reproducing cellular automata. Math. Biosci., 18:23-54, 1973.
R. Vollmar. Basic research for cellular processing. In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, pages 205-222. LNCS 342. Springer, October 1988.
R. Vollmar and B. G. Teubner. Algorithmen in Zellularautomaten. Stuttgart, 1979.
B. Voorhees. Nearest neighbor CA over with periodic boundary conditions. Physica D, 45:26, 1990.
B Voorhees. Predecessors of cellular automata states. I. additive automata. Physica D, 68(2):283, October 1993.
B Voorhees. Predecessors of cellular automata states.II.pre-images of finite sequences. Physica D, 73(1 / 2):136, 1994.
B Voorhees and S Bradshaw. Predecessors of cellular automata states.III.garden of eden classification of cellular automata. Physica D, 73(1 / 2):152, 1994.
Burton Voorhees. Division algorithm sic for cellular automata rules. Complex Systems, 4(6):587-597, December 1990.
Burton Voorhees. Geometry and arithmetic of a simple cellular automaton. Complex Systems, 5(2):169-182, April 1991.
Burton Voorhees. Determination of fixed points and shift cycles for nearest neighbor cellular automata. Journal of Statistical Physics, 66(5 / 6):1397, March 1992.
Burton H. Voorhees. Computational Analysis of One-Dimensional Cellular Automata. World Scientific, 1996.
Ken-nosuke Wada, Yoshiko Wada, Hirofumi Doi, Shin-ichi Tanaka, and Mitsuri Furusawa. Evolutionary systems: Structures and functions. In Proceedings of IEEE International Conference on Evolutionary Computation (ICEC-94), World Congress on Computational Intelligence, pages 796-801, Orlando, Florida, USA, jun 1994. IEEE Computer Society Press, New York.
L. Wagner. Dependence of drag on a galilean invariance-breaking parameter in lattice-boltzmann flow simulations. Physical Review E, 49:2115, 1994.
P. Wagner. Traffic simulations using cellular automata: comparison with reality. Traffic and Granular Flow, Conference Proceedings, 1995.
Robert T. Wainwright. self, 1973. a quarterly newsletter with 11 issues published between March 1971 and September 1973.
Abraham. Waksman. An optimum solution to the firing squad synchronization problem. Information and Control, 9:66-78, 1966.
C. C. Walker. Attractor dominance patterns in sparsely connected boolean nets. Physica D, 45:441-451, 1990.
Hao Wang. Notes on a class of tiling problems. Fundamenta Mathemastecae, 82, 1975.
John Watrous. On one-dimensional quantum cellular automata. In 36th Annual Symposium on Foundations of Computer Science, pages 528-537, Milwaukee, Wisconsin, 1995. IEEE.
W. G. Wee and K. S. Fu. A Formulation of Fuzzy Automata and its Application as Model of Learning Systems. IEEE Transactions on Systems, Man, Cybernetics, 5:215-223, 1969.
Jörg R. Weimar. Spontaneous nucleation in a reactive lattice gas automaton. In Stefan Müller and Theo Plesser, editors, Spatio-temporal organization in nonequilibrium systems, pages 266-269, Dortmund, Germany, 1992. Projekt Verlag.
Jorg R Weimar and Jean-Pierre Boon. Class of cellular automata for reaction-diffusion systems. Physical Review E, 49(2):1749, February 1994.
Jörg R. Weimar and Jean-Pierre Boon. A new class of cellular automata for reaction-diffusion systems. Physical Review E, to appear, 1994.
Jörg R. Weimar and Jean-Pierre Boon. New class of cellular automata for reaction-diffusion systems applied to the CIMA reaction. In A. Lawniczak and R. Kapral, editors, Lattice Gas Automata and Pattern Formation, Waterloo, Ont, Canada, 1994. Fields Institute.
Jörg R. Weimar, David Dab, Jean-Pierre Boon, and Sauro Succi. Fluctuation correlations in reaction-diffusion systems: Reactive lattice gas automata approach. Europhysics Letters, 20(7):627-632, 1992.
Jörg R. Weimar, John J. Tyson, and Layne T. Watson. Diffusion and wave propagation in cellular automaton models of excitable media. Physica D, 55:309-327, 1992.
Jörg R. Weimar, John J. Tyson, and Layne T. Watson. Third generation cellular automaton for modeling excitable media. Physica D, 55:328-339, 1992.
Gérard Weisbuch, Howard Gutowitz, and Guillemette Duchateau-Nguyen. Information contagion and the economics of pollution. Journal of Economic Behavior and Organization, in press, 1996.
Benjamin Weiss. Subshifts of finite type and sofic systems. Monatshefte fuer Mathematik, 77:462-474, 1973.
R. White and G. Engelen. Urban system dynamics and cellular automata: Fractal structures between order and chaos. unknown, 1900.
R White and G Engelen. Cellular automata and fractal urban form: a cellular modelling approach to the evolution of urban land-use patterns. Environment and planning, 25(8):1175, August 1993.
R. White, G. Engelen, and I. Uljee. Cellular automata modelling of fractal urban land use patterns: Forcasting change for planning applications. unknown, 1900.
J. Wiedermann. Weak parallel machines: a new class of physically feasible parallel machine models. In I. M. Havel and V. Koubek, editors, Proceedings of the 17th International Symposium Mathematical Foundations of Computer Science, pages 95-111. Springer-Verlag, 1992. LNCS 629.
Norbert Wiener. Cybernetics. John Wiley and Company, New York, 1948.
W. John Wilbur, David J. Lipman, and Shihab A. Shamma. On the prediction of local patterns in cellular automata. Physica D, 19:397-410, 1986.
W. Wilhelmi. Parallel algorithms in image processing. In G. Wolf, T. Legendi, and U. Schendel, editors, Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays, pages 223-240. LNCS 342. Springer, October 1988.
Kelly P. Williams. Simplifications of a self-replication model. Science, 261:925-925, 1993.
R. F. Williams. Classification of subshifts of finite type. Annals of Mathematics, 98:120-153, 1973.
Willson. Growth patterns of ordered cellular automata. Journal of Computer and Systems Sciences, 22, 1981.
Willson. Calculating growth rates and moments for additive cellular automata. Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 35, 1992.
Stephen J. Willson. Growth rates and fractional dimensions in cellular automata. Physica D, 10:69-74, 1984.
Greg Wilson. The life and times of cellular automata. New Scientist, pages 44-47, October 1988.
A. T. Winfree, E. M. Winfree, and H. Seifert. Organizing centers in a cellular excitable medium. Physica D, 17:109-115, 1985.
Arthur T. Winfree. Rotating chemical reactions. Scientific American, pages 82-95, June 1974.
G. Wolf, T. Legendi, and U. Schendel, editors. Parcella '88, Proceedings of the Fourth International Workshop on Parallel Processing by Cellular Automata and Arrays, Berlin, GDR, October 17-21, 1988. Akademie-Verlag, Berlin.
|Papers by Reif on Biomolecular Computing and Self Assembly of dna nanostructures (60 papers)||Basic Concepts and Molecular Computing Perspectives|
|Nov 3 – Election Day, Nov 11 – Veteran’s Day, Nov 26 Thanksgiving||The transformation of Molecular Biology on contact with higher organisms, 1960-1980: from a molecular description to a molecular explanation|
|C. Guignard, P. M. Anandarajah, Member, ieee, A. Clarke, Student Member, ieee, L. P. Barry, Member, ieee, O. Vaudel and P. Besnard||Keywords: Turing, Natural Philosophy, Natural Computing, Morphological Computing, Computational Universe, Info-computationalism, Computing and Philosophy|
|Departments of Molecular and Human Genetics, Biochemistry, and Molecular Virology and Microbiology, Baylor College of Medicine, Room S809A, Mail Stop 225, 1||Moving the Computing Curriculum toward Social Computing|
|The 28-th ieee international conference on plasma science and the 13-th ieee international pulsed power conference, 2001, стр. 913. Ru 2040108 C1, 20. 07. 1995. Ru 2087067 C1, 10. 08. 1997. Us h 148, 04. 11. 1986|
Список документов, цитированных в отчете о поиске: the 28-th ieee international conference on plasma science and the 13-th ieee international...
|C civil engineering: page 110 community education: page 116 computing – applied: page 122 computing – e-commerce: page 128 D|