recognition of promising scientific results in cellular automata” selected at the International Workshop AUTOMATA 2006 (13-15 September, 2006, University of Hiroshima, Japan) and at the Seventh International Conference on Cellular Automata in Research and Industry, ACRI 2006 (September 20-23, 2006, University of Perpignan, France). Matthias Schulz (Karlsruhe, Germany) received the Award for his...

The heart tissue is an excitable media. A Cellular Automata is a type of model that can be used to model cardiac action potential propagation. One of the advantages of this approach against the methods based on differential equations is its high speed in large scale simulations. Recent cellular automata models are not able to avoid flat edges in the result patterns or have large neighborhoods. ...

A Cellular Automata (CA) is a computing model of complex System using simple rule. In CA the problem space into number of cell and each cell can be one or several final state. Cells are affected by neighbours’ to the simple rule. Cellular Automata are highly parallel and discrete dynamical systems, whose behaviour is completely specified in terms of a local relation. This paper deals with the C...

We present the Bondable Cellular Automata model, which uses simple 1-dimensional, binary cellular automata as the base atomic elements of an artificial chemistry. Reactions are dependent upon an emergent, ‘resolution independent’ observable, measurable for individual or composite cellular automata structures. We discuss the rationale behind our choice of observable, ‘mean polarity’, and behind ...

In this paper, we propose a construction process that enables the transformation of an urban traffic network using a cellular automata lattice. An abstract network hierarchy is defined which allows us to describe the important properties of an urban traffic network layer by layer. The cellular automata lattice is extended with three additional types of cells that permit the modelling of conflic...

Several highway traffic models based on cellular automata have been proposed. The simplest one is elementary cellular automaton rule 184. We extend this model to city traffic with cellular automata coupled at intersections using only rules 184, 252, and 136. We study the model properties by simulating a single intersection. We describe the different dynamical phases of the model with velocity-d...

We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thus inheriting many of its properties. We then show how to simulate the canonical real computation model, BSS machines, with infinite time cellular automata in exactly ω steps.

quantum dot cellular automata (qca) is one of the important nano-level technologies for implementation of both combinational and sequential systems. qca have the potential to achieve low power dissipation and operate high speed at thz frequencies. however large probability of occurrence fabrication defects in qca, is a fundamental challenge to use this emerging technology. because of these vari...

A cellular automata (CA)-like model of mutually imitating agents, called imitating cellular automata (ICA), is presented. An agent of the model either imitates a behavior of neighboring agents or takes a random action to compute the next state of its own, based on elementary cellular automata (ECA) rules. When combined with another dynamic that determines an interaction distance to the neighbor...

Cellular Automata are being applied as a method for mathematical modelling and simulation in a variety of scientific areas. Usually a cellular automaton constitutes a microscopic description or abstraction of a natural system. The tools used for a mathematical derivation and validation of the cellular automaton modelling approach are however often optimised for specific natural systems. As a co...