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)
This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.
ChewingWord is a cross-platform on-screen keyboard for people with motor impairments and/or speech disorders, their care assistants, dyslexics and beginning readers. We focus on its interface, which aims to minimize the cognitive overload inherent to dynamic virtual keyboards, while preserving their main benefits: speed, power and fluidity.
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)