1 citations · 1 across the 2 of their papers we have counts for
7 papers
Complexity of limit cycles with block-sequential update schedules in conjunctive networks
Julio Aracena, Florian Bridoux, Luis Gómez +1
In this paper, we deal the following decision problem: given a conjunctive Boolean network defined by its interaction digraph, does it have a limit cycle of a given length k? We pr…
Commutative automata networks
Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier
Automata networks are mappings of the form f : Q Z Q Z , where Q is a finite alphabet and Z is a set of entities; they generalise Cellular Automata and Boolean networ…
Complexity of limit-cycle problems in Boolean networks
Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot +1
Boolean networks are a general model of interacting entities, with applications to biological phenomena such as gene regulation. Attractors play a central role, and the schedule of…
On simulation in automata networks
Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier
An automata network is a finite graph where each node holds a state from some finite alphabet and is equipped with an update function that changes its state according to the config…
Expansive Automata Networks
Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier
An Automata Network is a map where is a finite alphabet. It can be viewed as a network of entities, each holding a state from , and evolving acc…
Sequentialization and Procedural Complexity in Automata Networks
Florian Bridoux
In this article we consider finite automata networks (ANs) with two kinds of update schedules: the parallel one (all automata are updated all together) and the sequential ones (the…