Application of the graph cellular automaton in generating languages

B. Praba and R. Saranya

Mathematics and Computers in Simulation (MATCOM), 2020, vol. 168, issue C, 111-121

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 GCA, V,I,δ consisting of set of vertices and input symbols along with the time evolution function δ. Using the Basic Linear Rules, we define the kth 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 kth generation GCA is predicted corresponding to the fundamental basic linear rules. This enables us to predict the language of the kth generation automaton using all the 512 rules. All explained concepts are illustrated with suitable examples.

Keywords: Cellular automaton; Complete graph; Graph cellular automaton; Basic linear rules; Finite automaton (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475419302253
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:168:y:2020:i:c:p:111-121

DOI: 10.1016/j.matcom.2019.07.010

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().