Evolution Language Complexity of Cellular Automaton of Rule 122
-
Graphical Abstract
-
Abstract
The evolution languages of an elementary cellular automaton of rule 122 were studied.Its evolution language with width 1 is proved to be regular but the evolution languages with the width greater than 1 become irregular.Therefore the finite automaton cannot accept the evolution languages generated by elementary cellular automaton of rule 122.
-
-