1 citations · 1 across the 5 of their papers we have counts for
6 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…
There is no prime functional digraph: Seifert's proof revisited
Adrien Richard
A functional digraph is a finite digraph in which each vertex has a unique out-neighbor. Considered up to isomorphism and endowed with the directed sum and product, functional digr…
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…