1 citations · 2 across the 8 of their papers we have counts for
14 papers
Period Piece: NEXPTIME-complete problems on digraphs via Boolean network dynamics
Florian Bridoux, Maximilien Gadouleau, David C. Kutner +1
The central object in this work is the Boolean network, a function . Often identified with is its dynamics , the digraph with exactly $\{x \to y…
On the Dynamics of Bounded-Degree Automata Networks
Julio Aracena, Florian Bridoux, Maximilien Gadouleau +4
Automata networks can be seen as bare finite dynamical systems, but their growing theory has shown the importance of the underlying communication graph of such networks. This paper…
Dividing sums of cycles in the semiring of functional digraphs
Florian Bridoux, Christophe Crespelle, Thi Ha Duong Phan +1
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed wi…
Interaction graphs of isomorphic automata networks II: universal dynamics
Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard
An automata network with components over a finite alphabet of size is a discrete dynamical system described by the successive iterations of a function . I…
Asynchronous dynamics of isomorphic Boolean networks
Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard
A Boolean network is a function from which several dynamics can be derived, depending on the context. The most classical ones are the synchronous and asyn…
Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree
Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto +1
An automata network with components over a finite alphabet of size is a discrete dynamical system described by the successive iterations of a function . I…
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…
Complexity of fixed point counting problems in Boolean Networks
Florian Bridoux, Amélia Durbec, Kévin Perrot +1
A Boolean network (BN) with components is a discrete dynamical system described by the successive iterations of a function . This model finds applica…
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…
On the cost of simulating a parallel Boolean automata network by a block-sequential one
Florian Bridoux, Pierre Guillon, Kévin Perrot +2
In this article we study the minimum number of additional automata that a Boolean automata network (BAN) associated with a given block-sequential update schedule needs in order…