IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i9p1611-d415454.html
   My bibliography  Save this article

An Algorithm for Counting the Fixed Point Orbits of an AND-OR Dynamical System with Symmetric Positive Dependency Graph

Author

Listed:
  • Mauro Mezzini

    (Department of Education, Roma Tre University, 00154 Roma, Italy)

  • Fernando L. Pelayo

    (Escuela Superior de Ingenieria Informatica de Albacete, Computing Systems Department, University of Castilla-La Mancha, 02071 Albacete, Spain)

Abstract

In this paper we present an algorithm which counts the number of fixed point orbits of an AND-OR dynamical system. We further extend the algorithm in order to list all its fixed point orbits (FPOs) in polynomial time on the number of FPOs of the system.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:9:p:1611-:d:415454
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/9/1611/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/9/1611/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Juan A. Aledo & Silvia Martinez & Jose C. Valverde, 2015. "Parallel Dynamical Systems over Graphs and Related Topics: A Survey," Journal of Applied Mathematics, Hindawi, vol. 2015, pages 1-14, March.
    2. 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. 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.
    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. 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.
    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. 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.
    6. Sara D. Cardell & Amparo Fúster-Sabater, 2019. "Binomial Representation of Cryptographic Binary Sequences and Its Relation to Cellular Automata," Complexity, Hindawi, vol. 2019, pages 1-13, March.
    7. 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.
    8. Xiaoyan Zhang & Chao Wang, 2019. "Solutions to All-Colors Problem on Graph Cellular Automata," Complexity, Hindawi, vol. 2019, pages 1-11, June.

    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:gam:jmathe:v:8:y:2020:i:9:p:1611-:d:415454. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.