On the complexity of acyclic modules in automata networks

Modules were introduced as an extension of Boolean automata networks. They have inputs which are used in the computation said modules perform, and can be used to wire modules with each other. In the present paper we extend this new formalism and study the specific case of acyclic modules. These modu...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2020-02
Hauptverfasser:	Perrot, Kévin, Perrotin, Pacôme, Sené, Sylvain
Format:	Artikel
Sprache:	eng
Schlagworte:	Boolean algebra Complexity Modules Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!