Aristide Grange

Learn More
In this second part, we study the dynamics of the number conserving cellular automata. We give a classiÿcation which focuses on pattern divergence and chaoticity. Moreover we prove that in the case of number-conserving cellular automata, surjectivity is equivalent to regularity. As a byproduct we obtain a strong characterization of the class of cellular(More)
We introduce the strongly NP-complete pagination problem, an extension of Bin Packing where packing together two items may make them occupy less volume than the sum of their individual sizes. To achieve this property, an item is defined as a finite set of symbols from a given alphabet: while, in Bin Packing, any two such sets would be dis-joint, in(More)
  • 1