Browse Proceedings

Cellular Automata (CAs) have been proved to be a robust tool for mimicking a plethora of biological, physical and chemical systems. CAs can be used as an alternative to partial differential equations, in order to illustrate the evolution in time ...

The most important elements of block ciphers are nonlinear functions known as substitution boxes (S-boxes). S-boxes with weak cryptographic properties are vulnerable to attacks by various cryptanalysis techniques. Cellular Automata has been used ...

This work reports characterization of 1-dimensional periodic boundary cellular automata (PBCA) rules in 3-neighborhood for identification of CA rules that influence the formation of single length cycle attractors (fixed points). It targets the ...

In today’s world of digital technology revolution, the need for secure data transmission has become very crucial. Symmetric encryption algorithms play a very vital role in securing data in almost every application. MICKEY is an efficient and ...

We investigate S-boxes defined by pairs of Orthogonal Cellular Automata (OCA), motivated by the fact that such CA always define bijective vectorial Boolean functions, and could thus be interesting for the design of block ciphers. In particular, we ...$\mathrm{}$$\mathrm{}$$\mathrm{}\mathrm{}$$\mathrm{}\mathrm{}$${}^{}\mathrm{}$$\mathrm{}$

We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius r. We introduce a notion that we term cell stability with which we express the ...${{\mathrm{}}^{\mathrm{}}{\mathrm{}}^{}{\mathrm{}}^{\mathrm{}}{\mathrm{}}^{}}^{}$${}^{}$${}^{\mathrm{}}$${}^{\mathrm{}}$

In this paper, we study how synchronization and state estimation are related in the context of elementary cellular automata. We first characterize the synchronization error between two 1D elementary cellular automata implementing Wolfram’s 18^th ...

In this paper, we come back on the notion of local simulation allowing to transform a cellular automaton into a closely related one with different local encoding of information. In a previous paper, we applied it to the Firing Squad ...${}^{\mathrm{}}$

The problem of cellular automata coarse-graining is considered. The case of 1D boolean cellular automata (CA) is investigated. Probabilistic rules for 1D CA are parameterized. Then the coarse-graining procedure and the reduced probabilistic CA are ...

Inspired by the theory of continuous dynamical systems, Lyapunov exponents have been previously defined in the framework of cellular automata (CAs) in order to quantify a CA’s sensitive dependence on initial conditions, i.e. a CA’s sensitivity to ...

The aim of this work is to generate specific rules of deterministic and stochastic cellular automata (CA) using the set of five quantum gates, which is known to generate any quantum circuit. To build such quantum circuits, we use an evolutionary ...

Atherosclerosis, which refers to a reduction in vessels diameter due to fatty deposits, is considered as the main cause of heart attacks, strokes, and peripheral vascular disease. The malfunctioning of cardiovascular system is mainly related to ...

We show how to construct a deterministic nearest-neighbour cellular automaton (CA) with four states which emulates diffusion on a one-dimensional lattice. The pseudo-random numbers needed for directing random walkers in the diffusion process are ...

The evolution of microstructure of the precursor particles during the sintering of ceramic materials has been assessed by a cellular automaton model in which the only physical consideration for the evolution of the system is to minimize the ...

In this paper, we present a cellular automata model for a two-level laser which includes a saturable absorber. We show that the model reproduces laser passive Q-switching, a behavior in which intense short pulses of laser radiation are produced. ...

This work proposes a recent model for modelling the Phase Change (PC) phenomenon based on Cellular Automata (CA) of composite and heterogeneous materials with a complex geometry. We aim to describe the temperature distribution and phases (liquid/...

Current CMOS technology suffers from low device density and high power dissipation due to tremendous enhancement of device scaling. Quantum-dot Cellular Automata (QCA) is alternative nanotechnology to overcome these drawbacks. A cell containing ...

One of the most known physical experiments in quantum mechanics and optics is two-slit experiment on transition particles through the screen with two slits. It was important for establishing quantum mechanical description based on probability ...

We propose a second–order Cellular Automata (CA)–based approach to solve a problem of lifetime optimization in Wireless Sensor Networks (WSN). A WSN graph created for a given deployment of WSN in monitored area is considered as a multiagent system,...

In this paper, we investigate two concepts of system theory in the framework of cellular automata: spreadability and vulnerability. We have proposed adapting the definitions of these concepts for CA associated with a set of information ...

Forest fires have faced a huge increase due to climate change threatening different biomes. Fire propagation modeling is a critical issue to prevent and control the damage of this phenomenon. Cellular automata shown to be efficient in the ...

A significant increase in the occurrence of large wildfires has been observed in the last decades. Several works seek ways to attenuate the side effects of these events. In this work, it is proposed a simulation model for wildfires propagation ...

Cellular Automata have successfully been applied to the modeling and simulation of pedestrian dynamics. These simulations have often been focused on the evaluation of situations of medium-high density, in which the motivation of pedestrians ...