On the complexity of acyclic modules in automata networks

DOI10.1007/978-3-030-59267-7_15OpenAlexW3108094537MaRDI QIDQ2110708

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

Publication date: 22 December 2022

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Optimising attractor computation in Boolean automata networks

This page was built for publication: On the complexity of acyclic modules in automata networks