Showing math.COShow all
3 papers · 1 filter
math.CO2024
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…
math.CO2023
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…
math.CO2021
Isomorphic Boolean networks and dense interaction graphs
Aymeric Picard Marchetto, Adrien Richard
A Boolean network (BN) with components is a discrete dynamical system described by the successive iterations of a function . In most applications, the…