The problem of synchronizing a network of identical processors that work synchronously at discrete steps is studied. Processors are arranged as an array of m rows and n columns and can exchange each other only one bit of information. We give algorithms which synchronize square arrays of (n × n) processors and give some general constructions to synchronize arrays of (m × n) processors. Algorithms are given to synchronize in time n2, $n\lceil logn\rceil$, $n\lceil \sqrt{n}\rceil$ and 2n a square array of (n × n) processors. Our approach...

A computational framework for testing the effects of cytotoxic molecules, specific to a given phase of the cell cycle, and vascular disrupting agents (VDAs) is presented. The model is based on a cellular automaton to describe tumour cell states transitions from proliferation to death. It is coupled with a model describing the tumour vasculature and its adaptation to the blood rheological constraints when alterations are induced by VDAs treatment....

On explicite une conjugaison en mesure entre le décalage sur le système dynamique associé à une substitution primitive et une transformation adique sur le support d'un sous-shift de type fini, à savoir l'ensemble des chemins d'un automate dit des préfixes-suffixes. En caractérisant les préimages par la conjugaison des chemins périodiques de l'automate, on montre que cette conjugaison est injective sauf sur un ensemble dénombrable, sur lequel elle est finie-à-un. On en déduit l'existence d'une suite...

Let $T:x\mapsto x+g$ be an ergodic translation on the compact group $C$ and $M\subseteq C$ a continuity set, i.e. a subset with topological boundary of Haar measure 0. An infinite binary sequence $\mathbf{a}:\mathbb{Z}\mapsto \{0,1\}$ defined by $\mathbf{a}\left(k\right)=1$ if $T^k\left(0_C\right)\in M$ and $\mathbf{a}\left(k\right)=0$ otherwise, is called a Hartman sequence. This paper studies the growth rate of $P_{\mathbf{a}}\left(n\right)$, where $P_{\mathbf{a}}\left(n\right)$ denotes the number of binary words of length $n\in \mathbb{N}$ occurring in $\mathbf{a}$. The growth rate is always subexponential and this result is optimal. If $T$ is an ergodic translation $x\mapsto x+\alpha$$...$

We consider the problem of embedding odometers in one-dimensional cellular automata. We show that (1) every odometer can be embedded in a gliders-with-reflecting-walls cellular automaton, which one depending on the odometer, and (2) an odometer can be embedded in a cellular automaton with local rule $x_i\mapsto x_i+x_{i+1}modn$ (i ∈ ℤ), where n depends on the odometer, if and only if it is “finitary.”

Lorsqu'on observe des orbites de certains automates cellulaires, on peut penser qu'elles apparaissent comme des mélanges d'orbites d'autres automates (composants). Dans cet article, nous tentons de comprendre ce phénomène en construisant un hybride de deux automates au moyen d'un troisième. Deux types d'automates cellulaires sont introduits : les captifs et les foulards. Nous comparons des propriétés de ces hybrides dans le cadre des classifications algébriques introduites par [B. Martin...

Despite recent advances, treatment of patients with aggressive Non-Hodgkin's lymphoma (NHL2) has yet to be optimally designed. Notwithstanding the contribution of molecular treatments, intensification of chemotherapeutic regimens may still be beneficial. Hoping to aid in the design of intensified chemotherapy, we put forward a mathematical and computational model that analyses the effect of Doxorubicin on NHL over a wide range of patho-physiological conditions. The model represents tumour growth...

Gliomas are highly invasive brain tumors that exhibit high and spatially heterogeneous cell proliferation and motility rates. The interplay of proliferation and migration dynamics plays an important role in the invasion of these malignant tumors. We analyze the regulation of proliferation and migration processes with a lattice-gas cellular automaton (LGCA). We study and characterize the influence of the migration/proliferation dichotomy (also known...

We show that for any cellular automaton (CA) ℤ²-action Φ on the space of all doubly infinite sequences with values in a finite set A, determined by an automaton rule $F=F_{[l,r]}$, l,r ∈ ℤ, l ≤ r, and any Φ-invariant Borel probability measure, the directional entropy $h_{v⃗}\left(\Phi \right)$, v⃗= (x,y) ∈ ℝ², is bounded above by $max\left(\right|z_l|,|z_r\left|\right)logA$ if $z_l{z}_r\ge 0$ and by $|z_r-z_l|$ in the opposite case, where $z_l=x+ly$, $z_r=x+ry$. We also show that in the class of permutative CA-actions the bounds are attained if the measure considered is uniform Bernoulli.