Creation of fixed points in block-parallel Boolean automata networks

DOI10.1007/978-3-032-15641-9_10MaRDI QIDQ7348926zbMATH OpenFDO

Authors Kévin Perrot, Sylvain Sené, Léah Tapin

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-15641-9_10

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• About block-parallel Boolean networks: a position paper
• Combinatorics of Boolean automata circuits dynamics
• Fixed points of Boolean networks, guessing graphs, and coding theory
• Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
• scientific article; zbMATH DE number 5852793 (Why is no real title available?)
• scientific article; zbMATH DE number 4042465 (Why is no real title available?)
• scientific article; zbMATH DE number 45557 (Why is no real title available?)
• scientific article; zbMATH DE number 50840 (Why is no real title available?)
• Information flows, graphs and their guessing numbers
• Itérations sur des ensembles finis et automates cellulaires contractants
• Maximum number of fixed points in regulatory Boolean networks
• Number of fixed points and disjoint cycles in monotone Boolean networks
• Turning block-sequential automata networks into smaller parallel networks with isomorphic limit dynamics

This page was built for publication: Creation of fixed points in block-parallel Boolean automata networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348926)