7 citations · 17 across the 12 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013★ 5 cited
A pumping lemma for non-cooperative self-assembly
Pierre-Étienne Meunier, Damien Regnault
We prove the computational weakness of a model of tile assembly that has so far resisted many attempts of formal analysis or positive constructions. Specifically, we prove that, in…
cs.FL2013★ 2 cited
Full characterisation of attractors of two intersected asynchronous Boolean automata cycles
Tarek Melliti, Mathilde Noual, Damien Regnault +2
The understanding of Boolean automata networks dynamics takes an important place in various domains of computer science such as computability, complexity and discrete dynamical sys…