4 citations · 7 across the 3 of their papers we have counts for
5 papers
On the directed tile assembly systems at temperature 1
Pierre-Étienne Meunier, Damien Regnault
We show here that a model called directed self-assembly at temperature 1 is unable to do complex computations like the ones of a Turing machine. Since this model can be seen as a g…
The program-size complexity of self-assembled paths
Pierre-Étienne Meunier, Damien Regnault, Damien Woods
We prove a Pumping Lemma for the noncooperative abstract Tile Assembly Model, a model central to the theory of algorithmic self-assembly since the beginning of the field. This theo…
It's a Tough Nanoworld: in Tile Assembly, Cooperation is not (strictly) more Powerful than Competition
Florent Becker, Pierre-Étienne Meunier
We present a strict separation between the class of "mismatch free" self-assembly systems and general aTAM systems. Mismatch free systems are those systems in which concurrently gr…
Intrinsic universality in tile self-assembly requires cooperation
Pierre-Étienne Meunier, Matthew J. Patitz, Scott M. Summers +3
We prove a negative result on the power of a model of algorithmic self-assembly for which it has been notoriously difficult to find general techniques and results. Specifically, we…
Communications in cellular automata
Eric Goles, Pierre-Etienne Meunier, Ivan Rapaport +1
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic pr…