Application of the graph cellular automaton in generating languages

Abstract The purpose of this research is to strengthen the core of Cellular Automaton using the concept of Graph theory and Automata theory. In this paper we introduce a new approach of defining the Graph Cellular Automaton G C A , V , I , δ consisting of set of vertices and input symbols along with the time evolution function δ . Using the Basic Linear Rules, we define the k th generation GCA. This method enables us to capture the complete characterization of the future generations. When the defined GCA is taken as a graph corresponding to a given finite automaton, then the language generated by the k th generation GCA is predicted corresponding to the fundamental basic linear rules. This enables us to predict the language of the k th generation automaton using all the 512 rules. All explained concepts are illustrated with suitable examples.