Solutions to All-Colors Problem on Graph Cellular Automata

The All-Ones Problem comes from the theory of σ+-automata, which is related to graph dynamical systems as well as the Odd Set Problem in linear decoding. In this paper, we further study and compute the solutions to the “All-Colors Problem,” a generalization of “All-Ones Problem,” on some interesting...

Full description

Bibliographic Details
Main Authors: Xiaoyan Zhang, Chao Wang
Format: Article
Language:English
Published: Hindawi-Wiley 2019-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2019/3164692