1 citations · 2 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
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 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…