Cellular Automata equivalent to D0L Systems
نویسندگان
چکیده
This paper describes an algorithm for the construction of a certain one-dimensional cellular automaton equivalent to a given D0L system. A cellular automaton is considered equivalent to an L-system if both generates the same words in the same order. Our cellular automata produce the same words and in the same order as the given D0L system for a finite number of derivations. There is no constraint to the D0L system considered, so the method is a general algorithm and can be used as a proof for an equivalence theorem. Key-Words: Cellular automata, Lindenmayer systems, parallel derivation grammar, theoretical computer science, formal languages
منابع مشابه
On Formal Power Series Generated by Lindenmayer Systems
To study power series generated by Lindenmayer systems we de ne L algebraic systems and series over arbitrary commutative semirings. We establish closure and xed point properties of L algebraic series. We show how the framework of L algebraic series can be used to de ne D0L, 0L, E0L, DT0L, T0L and ET0L power series. We generalize for power series the classical result stating that D0L languages ...
متن کاملUni-transitional Watson-crick D0l Systems Uni-transitional Watson-crick D0l Systems
The phenomenon known as Watson-Crick complementarity is basic both in the experiments and theory of DNA computing. While the massive parallelism of DNA strands makes exhaustive searches possible, complementarity constitutes a powerful computational tool. It is also very fruitful to view complementarity as a language-theoretic operation: \bad" words obtained through a generative process are repl...
متن کاملPattern Formation of the FitzHugh-Nagumo Model: Cellular Automata Approach
FitzHugh-Nagumo (FHN) model is a famous Reaction-Diffusion System which first introduced for the conduction of electrical impulses along a nerve fiber. This model is also considered as an abstract model for pattern formation. Here, we have used the Cellular Automata method to simulate the pattern formation of the FHN model. It is shown that the pattern of this model is very similar to those...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملFast Cellular Automata Implementation on Graphic Processor Unit (GPU) for Salt and Pepper Noise Removal
Noise removal operation is commonly applied as pre-processing step before subsequent image processing tasks due to the occurrence of noise during acquisition or transmission process. A common problem in imaging systems by using CMOS or CCD sensors is appearance of the salt and pepper noise. This paper presents Cellular Automata (CA) framework for noise removal of distorted image by the salt an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004