Introduction to the special issue on cellular automata

Parallel Computing

Volumn 23, Issue 11, 1997, Pages 1567-1576

  Kutrib, M ^a   Vollmar, R ^b   Worsch, Th ^b  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Cellular automata

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS;

CELLULAR AUTOMATA (CA);

AUTOMATA THEORY;

EID: 0031276662     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (52)

1. J. Albert, K. Čulik II, A simple universal cellular automaton and its oneway and totalistic version, Complex Systems 1 (1987) 1-16.
2. J.-P. Allouche, F. v. Haeseler, E. Lange, A. Petersen, G. Skordev, Linear cellular automata and automatic sequences, Parallel Computing (1997), this issue.
3. S. Amoroso, A parallel-acting iterative automaton, in: 8th IEEE Symposium on Foundations of Computer Science (FOCS '67), 1967, pp. 83-94.
4. S. Amoroso, G. Cooper, Tesselation structures for reproduction of arbitrary patterns, Journal of Computer and System Sciences 5 (1971) 455-464.
5. S. Amoroso, Y.N. Patt, Decision procedures for surjectivity and infectivity of parallel maps for tesselation structures, Journal of Computer and System Sciences 6 (1972) 448-464.
6. E.R. Banks, Universality in cellular automata, in: Proc. 11th IEEE Symposium on Foundations of Computer Science (FOCS), 1970, pp. 194-215.
7. A.G. Barto, A note on pattern reproduction in tessellation structures, Journal of Computer and System Sciences 16 (1978) 445-455.
8. T. Buchholz, M. Kutrib, Some relations between massively parallel arrays, Parallel Computing (1997), this issue.
9. A.W. Burks, Essays on Cellular Automata, University of Illinois Press, Urbana, 1970.
10. G. Cattaneo, E. Formenti, L. Margara, G. Mauri, Transformations of the one-dimensional cellular automata rule space, Parallel Computing (1997), this issue.
11. B. Chopard, M. Droz, Cellular Automata Modeling of Physical Systems, Cambridge University Press, 1997, to appear.
12. E.F. Codd, Cellular Automata, Academic Press, New York, 1968.
13. S.N. Cole, Real-time computation by n-dimensional iterative arrays of finite state machines, IEEE Transactions on Computers 18 (4) (1969) 349-365.
14. M.J.B. Duff, CLIP-4, in: K.S. Fu (Ed.), Special Computer Architectures for Pattern Processing, CRC Press, 1980.
15. B. Durand, The subjectivity problem for 2D cellular automata, Journal of Computer and System Sciences 49 (1994) 718-725.
16. C.R. Dyer, One-way bounded cellular automata, Information and Control 44 (1980) 261-281.
17. J.D. Farmer, T. Toffoli, S. Wolfram (Eds.), Cellular Automata: Proceedings of an Interdisciplinary Workshop at Los Alamos, Ned, Medico, March 7-11, 1983, North-Holland, Amsterdam, 1984.
18. P. Flocchini, F. Geurts, N. Santoro. CA-like error propagation in fuzzy CA, Parallel Computing (1997), this issue.
19. U. Frisch, B. Hasslacher, Y. Pomeau, Lattice-gas automata for the Navier-Stokes equation, Physical Review Letters 56 (1986) 1505-1508.
20. M. Garzon, Models of Massive Parallelism, Springer-Verlag, Berlin, 1995.
21. D. Gordon, On the computational power of totalistic cellular automata, Mathematical Systems Theory 20 (1987) 43-52.
22. E. Goto, A minimum time solution of the Firing Squad Problem, Course notes for Applied Mathematics 298, 1962.
23. G.A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory 3 (1969) 320-375.
24. O. Heen, Efficient constant speed-up for one dimensional cellular automata calculators, Parallel Computing (1997), this issue.
25. O.H. Ibarra, M.A. Palis, Two-dimensional iterative arrays: Characterizations and applications, Theoretical Computer Science 57 (1988) 47-86.
26. J. Kari, Reversibility of 2D cellular automata is undecidable, Physica D 45 (1990) 375-385.
27. T. Legendi, E. Katona, A 5 state solution of the early bird problem in a one dimensional cellular space, Acta Cybernetica 5 (2) (1981) 173-179.
28. M. Markus, T. Hahn, I. Kusch, A novel quantification of cellular automata, Parallel Computing (1997), this issue.
29. J. Mazoyer, On optimal solutions to the firing squad synchronization problem, Theoretical Computer Science 168 (2) (1996) 367-404.
30. M. Minsky, Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, NJ, 1967.
31. E.F. Moore, The firing squad synchronization problem, in: E.F. Moore (Ed.), Sequential Machines -Selected Papers, Addison-Wesley, 1964, pp. 213-214.
32. K. Preston, Jr., J.B. Duff, Modern Cellular Automata, Plenum Press, New York, 1984.
33. D. Richardson, Tessellations with local transformations, Journal of Computer and System Sciences 6 (1972) 373-388.
34. P. Rosenstiehl., J.R. Fiksel, A. Holliger, Intelligent graphs: Networks of finite automata capable of solving graph problems, in: R.C. Read (Ed.), Graph Theory and Computing, Academic Press, New York, 1972, pp. 219-265.
35. A.R. Smith III, Cellular automata and formal languages, in: 11th Annual IEEE Symposium on Switching and Automata Theory, 1970, pp. 216-224.
36. A.R. Smith III, Cellular automata complexity trade-offs, Information and Control 18 (1971) 466-482.
37. A.R. Smith III, Simple computation-universal cellular spaces, Journal of the ACM 18 (1971) 339-353.
38. A.R. Smith III, Two-dimensional formal languages and pattern recognition by cellular automata, in: IEEE Conference Record of 12th Annual Symposium on Switching and Automata Theory, IEEE, 1971, pp. 144-152.
39. A.R. Smith III, Real-time language recognition by one-dimensional cellular automata, Journal of Computer and System Sciences 6 (1972) 233-253.
40. K. Sutner, Linear cellular automata and Fischer automata, Parallel Computing (1997), this issue.
41. H. Szwerinski, Symmetrical one-dimensional cellular spaces, Information and Control 67 (1985) 163-172.
42. R. Vollmar, Cellular spaces and parallel algorithms, in: M. Feilmeier (Ed.), Parallel Computers - Parallel Mathematics, IMACS, North-Holland, 1977, pp. 49-58.
43. R. Vollmar, Algorithmen in Zellularautomaten, Teubner, Stuttgart, 1979.
44. J. von Neumann, Theory of Self-Reproducing Automata, University of Illinois Press, 1966 [Edited and completed by Arthur W. Burks].
45. B.H. Voorhees, Computational Analysis of One-Dimensional Cellular Automata, World Scientific, 1996.
46. J. Watrous, On one-dimensional quantum cellular automata, in: Proceedings 36th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1995, pp. 528-537.
47. J.R. Weimar, Cellular automata for reaction-diffusion systems, Parallel Computing (1997), this issue.
48. J. Wiedermann, Weak parallel machines: A new class of physically feasible parallel machine models, in: I.M. Havel, V. Koubek (Eds.), MFCS '92, 17th International Symposium Mathematical Foundations of Computer Science, Springer-Verlag, 1992, pp. 95-111.
49. N. Wiener, A. Rosenblueth, The mathematical formulation of the problem of conduction of impulses in a network of connected excitable elements, specifically in cardiac muscle, Archives del Instituto de Cardiologia de Mexico XVI, 1946, pp. 205-265.
50. S. Wolfram, Computation theory of cellular automata, Communications on Mathematical Physics 96 (1984) 15-57.
51. Th. Worsch, On parallel Turing machines with multi-head control units, Parallel Computing (1997), this issue.
52. H. Yamada, S. Amoroso, Tesselation automata, Information and Control 14 (1969) 299-317.