On Fixable Families of Boolean Networks

DOI10.1007/978-3-319-99813-8_36zbMath1515.68162arXiv1804.01931OpenAlexW2962771155MaRDI QIDQ6163607

Adrien Richard, Maximilien Gadouleau

Publication date: 30 June 2023

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.01931

zbMATH Keywords

fixed pointsBoolean networksasynchronous dynamicsasynchronous graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Symbolic dynamics (37B10) Dynamical systems involving maps of trees and graphs (37E25)

Cites Work

• Connectivity and dynamics for random subgraphs of the directed cube
• Itérations sur des ensembles finis et automates cellulaires contractants
• On the Convergence of Boolean Automata Networks without Negative Cycles
• Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks
• Digraphs

This page was built for publication: On Fixable Families of Boolean Networks