research
∙
01/05/2023
Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree
An automata network with n components over a finite alphabet Q of size q...
share
research
∙
03/21/2022
Complexity of limit cycles with block-sequential update schedules in conjunctive networks
In this paper, we deal the following decision problem: given a conjuncti...
research
∙
12/04/2020
Complexity of fixed point counting problems in Boolean Networks
A Boolean network (BN) with n components is a discrete dynamical system ...
research
∙
04/21/2020
Commutative automata networks
Automata networks are mappings of the form f : Q Z → Q Z , where Q is a ...
research
∙
01/24/2020
On simulation in automata networks
An automata network is a finite graph where each node holds a state from...
research
∙
01/24/2020
Simulation of automata networks
An automata network is a finite graph where each node holds a state from...
research
∙
01/21/2020
Complexity of limit-cycle problems in Boolean networks
Boolean networks are a general model of interacting entities, with appli...
research
∙
02/21/2019
Expansive Automata Networks
An Automata Network is a map f:Q^n→ Q^n where Q is a finite alphabet. It...
research
∙
03/01/2018
