7 citations · 30 across the 15 of their papers we have counts for
Showing 2016 · cs.DMShow all
2 papers · 2 filters
cs.DM2016
Shortest Trajectories and Reversibility in Boolean Automata Networks
Mathilde Noual
The question this research report explores is the following: when does a shortest trajectory between two configurations, or between one configuration and an attractor need to chang…
cs.DM2016
A combinatorial problem about binary necklaces and attractors of Boolean automata networks
Mathilde Noual
It is known that there are no more Lyndon words of length n than there are periodic necklaces of same length. This paper considers a similar problem where, additionally, the neckla…