IDEAS home Printed from https://ideas.repec.org/a/hin/complx/3164692.html
   My bibliography  Save this article

Solutions to All-Colors Problem on Graph Cellular Automata

Author

Listed:
  • Xiaoyan Zhang
  • Chao Wang

Abstract

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, - Random Weak-All-Colors Problem, which is relevant to both combinatorial number theory and cellular automata theory.

Suggested Citation

  • Xiaoyan Zhang & Chao Wang, 2019. "Solutions to All-Colors Problem on Graph Cellular Automata," Complexity, Hindawi, vol. 2019, pages 1-11, June.
  • Handle: RePEc:hin:complx:3164692
    DOI: 10.1155/2019/3164692
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2019/3164692.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2019/3164692.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/3164692?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Barrett, Chris L & Chen, William Y.C & Zheng, Michelle J, 2004. "Discrete dynamical systems on graphs and Boolean functions," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 66(6), pages 487-497.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2020. "Coexistence of Periods in Parallel and Sequential Boolean Graph Dynamical Systems over Directed Graphs," Mathematics, MDPI, vol. 8(10), pages 1-14, October.
    2. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2019. "Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems," Complexity, Hindawi, vol. 2019, pages 1-10, March.
    3. Mauro Mezzini & Fernando L. Pelayo, 2020. "An Algorithm for Counting the Fixed Point Orbits of an AND-OR Dynamical System with Symmetric Positive Dependency Graph," Mathematics, MDPI, vol. 8(9), pages 1-9, September.
    4. Aledo, Juan A. & Diaz, Luis G. & Martinez, Silvia & Valverde, Jose C., 2019. "Solution to the predecessors and Gardens-of-Eden problems for synchronous systems over directed graphs," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 22-28.
    5. Aledo, Juan A. & Diaz, Luis G. & Martinez, Silvia & Valverde, Jose C., 2019. "Dynamical attraction in parallel network models," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 874-888.
    6. Juan A. Aledo & Ali Barzanouni & Ghazaleh Malekbala & Leila Sharifan & Jose C. Valverde, 2020. "On the Periodic Structure of Parallel Dynamical Systems on Generalized Independent Boolean Functions," Mathematics, MDPI, vol. 8(7), pages 1-14, July.
    7. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2017. "On the Periods of Parallel Dynamical Systems," Complexity, Hindawi, vol. 2017, pages 1-6, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:3164692. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.