Linear Cellular Automata and de Bruijn Automata
نویسنده
چکیده
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiau-tomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram's question about the growth rates of the minimal nite state machines associated with iterates of a cellular automaton.
منابع مشابه
Linear Cellular Automata and Finite Automata
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...
متن کامل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 ...
متن کامل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 ...
متن کاملComputation of Explicit Preimages in One-Dimensional Cellular Automata Applying the De Bruijn Diagram
This paper shows how to simplify the calculation of preimages in cellular automata. The method is based on the so called De Bruijn diagrams and work for any k-states and r-radius in one dimensional space. In order to calculate preimages, we construct preimage matrices from the De Bruijn diagram and an operator defined on these matrices. In this way the problem of calculating preimages is reduce...
متن کاملDe Bruijn Graphs and Linear Cellular Automata
De Bruijn graphs provide a convenient way to describe configura tions of linear cellular automata (CAs). Using these graphs, we give a simple quadra tic time algorithm to determine whether a linear CA is reversible. Similarly, one can decide in quadratic time whether the global map of the auto mato n is surjective. We also show that every recursive configuration that has a predecessor on a line...
متن کامل