7 citations · 17 across the 12 of their papers we have counts for
18 papers
A linear bound for the size of the finite terminal assembly of a directed non-cooperative tile assembly system
Sergiu Ivanov, Damien Regnault
The abstract tile assembly model (aTam) is a model of DNA self-assembly. Most of the studies focus on cooperative aTAM where a form of synchronization between the tiles is possible…
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata
Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel +1
We study the complexity relationship between three models of unbounded memory automata: nu-automata (-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). Thes…
Boolean automata isolated cycles and tangential double-cycles dynamics
Jacques Demongeot, Tarek Melliti, Mathilde Noual +2
Our daily social and political life is more and more impacted by social networks. The functioning of our living bodies is deeply dependent on biological regulation networks such as…
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width
Eric Angel, Sébastien Morais, Damien Regnault
In this paper we study a scheduling problem arising from executing numerical simulations on HPC architectures. With a constant number of parallel machines, the objective is to mini…
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…