Displaying similar documents to “Universality of reversible hexagonal cellular automata”

Number-conserving reversible cellular automata and their computation-universality

Kenichi Morita, Katsunobu Imai (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We introduce a new model of cellular automaton called a one-dimensional number-conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a triple of non-negative integers, and the total (i.e., sum) of integers over the configuration is conserved throughout its evolving (computing) process. It can be thought as a kind of modelization of the physical conservation law of mass (particles) or energy. We also define a reversible...

The onset of necrosis in a 3D cellular automaton model of EMT6 multi-cellular spheroids

Simon D. Angus, Monika J. Piotrowska (2010)

Applicationes Mathematicae

Similarity:

A 3-dimensional (3D) extension to a previously reported scaled 2-dimensional Cellular Automaton (CA) model of avascular multi-cellular spheroid growth is presented and analysed for the EMT6/Ro cell line. The model outputs are found to compare favourably with reported experimentally obtained data for in vitro spheroids of the same cell line. Necrosis (unprogrammed central cell death) is observed to be delayed when compared with the experimental data. Furthermore, it is found that necrosis...

Some results on cellular automata

Claudio Baiocchi (1998)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Similarity:

We want to discuss some properties of one-dimensional, radius 1, CUCAs (we denote by CUCA a Computationally Universal Cellular Automaton; see later on for the definitions). In particular, on one hand we want to keep small the number of states (the first example of «small» CUCA is due to Smith III [13]; it requires 18 states); on the other hand we are interested into automata, possibly requiring a high number of states, whose transition law is «as simple as possible»; e.g. totalistic...