![](/images/graphics-bg.png)
Solutions to All-Colors Problem on Graph Cellular Automata
Joint Authors
Source
Issue
Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-11, 11 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2019-06-02
Country of Publication
Egypt
No. of Pages
11
Main Subjects
Abstract EN
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 classes of graphs which can be divided into two subproblems: Strong-All-Colors Problem and Weak-All-Colors Problem, respectively.
We also introduce a new kind of All-Colors Problem, k-Random Weak-All-Colors Problem, which is relevant to both combinatorial number theory and cellular automata theory.
American Psychological Association (APA)
Zhang, Xiaoyan& Wang, Chao. 2019. Solutions to All-Colors Problem on Graph Cellular Automata. Complexity،Vol. 2019, no. 2019, pp.1-11.
https://search.emarefa.net/detail/BIM-1131346
Modern Language Association (MLA)
Zhang, Xiaoyan& Wang, Chao. Solutions to All-Colors Problem on Graph Cellular Automata. Complexity No. 2019 (2019), pp.1-11.
https://search.emarefa.net/detail/BIM-1131346
American Medical Association (AMA)
Zhang, Xiaoyan& Wang, Chao. Solutions to All-Colors Problem on Graph Cellular Automata. Complexity. 2019. Vol. 2019, no. 2019, pp.1-11.
https://search.emarefa.net/detail/BIM-1131346
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1131346