Representation of some cellular automata by means of equivalent L Systems
作者： Manuel Alfonseca , Alfonso Ortega
DOI:
关键词: Stochastic cellular automaton 、 Mathematics 、 Automata theory 、 Mobile automaton 、 ω-automaton 、 Quantum finite automata 、 Cellular automaton 、 Theoretical computer science 、 Quantum cellular automaton 、 Continuous spatial automaton
摘要: This paper presents some facts that make cellular automata parallel to L Systems. Several examples of are considered and equivalent Systems constructed. A general procedure should be able manage n-dimensional automata, thus one-dimensional, twodimensional three-dimensional studied here. Some recommendations generalise the techniques given. The comments on difficulties develop a reasons give several instead an algorithm.
参考文章(13)
György E. Révész, Introduction to formal languages ,(1983)
Arthur Walter Burks, Essays on cellular automata ,(1970)
Aristid Lindenmayer, Mathematical Models for Cellular Interactions in Development ,(1968)
Vito Volterra, Marcel Brelot, Leçons sur la théorie mathématique de la lutte pour la vie Éditions Jacques Gabay. ,(1931)
Seymour Papert, Mindstorms: Children, Computers, And Powerful Ideas ,(1980)
André Stauffer, Moshe Sipper, On the relationship between cellular automata and L-systems: the self-replication case Physica D: Nonlinear Phenomena. ,vol. 116, pp. 71- 80 ,(1998) , 10.1016/S0167-2789(97)00255-8
Benoit B. Mandelbrot, The Fractal Geometry of Nature ,(1982)
Aristid Lindenmayer, Mathematical models for cellular interactions in development II. Simple and branching filaments with two-sided inputs Journal of Theoretical Biology. ,vol. 18, pp. 300- 315 ,(1968) , 10.1016/0022-5193(68)90080-5
Peter Linz, An Introduction to Formal Languages and Automata ,(1996)
Arthur W. Burks, John Von Neumann, Theory Of Self Reproducing Automata ,(1966)