Representation of some cellular automata by means of equivalent L Systems
Manuel Alfonseca, Alfonso Ortega · 2000
This paper presents some facts that make cellular automata parallel to L Systems. Several examples of cellular automata are considered and equivalent L Systems are constructed. A general procedure should be able to manage n-dimensional cellular automata, thus one-dimensional, twodimensional and three-dimensional cellular automata are studied here. Some recommendations to generalise the techniques to n-dimensional automata are given. The paper comments on the difficulties to develop a general procedure and the reasons to give several recommendations instead of an algorithm.