Optimising attractor computation in Boolean automata networks

DOI10.1007/978-3-030-68195-1_6OpenAlexW3134455039MaRDI QIDQ2232265

Sylvain Sené, Pacôme Perrotin, Kévin Perrot

Publication date: 4 October 2021

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

zbMATH Keywords

optimisationmodularityBoolean automata networks

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Combinatorics of Boolean automata circuits dynamics
• Comparison between parallel and serial dynamics of Boolean networks
• Maximum number of fixed points in regulatory Boolean networks
• A framework for (de)composing with Boolean automata networks
• On the complexity of acyclic modules in automata networks
• Complexity of maximum fixed point problem in Boolean networks
• Dynamics of Circuits and Intersecting Circuits
• Circuit minimization problem
• Neural networks and complexity theory
• Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks

This page was built for publication: Optimising attractor computation in Boolean automata networks