Application of the graph cellular automaton in generating languages

DOI10.1016/J.MATCOM.2019.07.010MaRDI QIDQ1997874zbMATH OpenOpenAlexFDO

Authors B. Praba, R. Saranya

Publication date 6 March 2021

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.matcom.2019.07.010

zbMATH Keywords

basic linear rulescellular automatoncomplete graphfinite automatongraph cellular automaton

Mathematics Subject Classification ID

Graph theory (05Cxx)

Recommendations

• Evolution complexity of the elementary cellular automaton of rule 22.
• AUTOMATIC GENERATION OF SELF-REPLICATING PATTERNS IN GRAPH AUTOMATA
• Using shape grammar to derive cellular automata rule patterns
• Ad-hoc Ma'qeli script generation using block cellular automata
• Evolution complexity of the elementary cellular automaton rule 18

Cites work

• Asymptotic Laplacian-energy-like invariant of lattices
• Cellular automata on graphs: topological properties of ER graphs evolved towards low-entropy dynamics
• Edge detection using cellular automata
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness

Cited in

(3)

• scientific article; zbMATH DE number 1775633 (Why is no real title available?)
• Ad-hoc Ma'qeli script generation using block cellular automata
• Generation of pseudo-isomorphic cellular automata

This page was built for publication: Application of the graph cellular automaton in generating languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1997874)