Planigon tessellation cellular automata
โ Scribed by Alexander Korobov
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 673 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1076-2787
No coin nor oath required. For personal study only.
โฆ Synopsis
Cellular automata (CA) do not find as wide a use in chemical complexity determined by a crystal structure as in homogeneous reacting systems. A reason for this is discussed, and a superposition of planigons and parallelogons or Wigner-Seitz tessellations is suggested that is derived from a crystallographic plane and is capable of representing chemical complexity at a single crystal face in terms of CA. The interplay between growth and form of two-dimensional negative crystals is discussed in these terms as a particular example.
๐ SIMILAR VOLUMES
This special issue of Parallel Computing mainly presents papers from lectures given at the IFIP Workshop on Cellular Automata held at the castle of Rauischholzhausen (University of GieBen, Germany) March 25-27, 1996. Subsequent to a seminar at Dagstuhl Castle in March 1995, it was the second event o
Amoroso and Cooper have shown that for an arbitrary state alphabet A, one-and two-dimensional tessellation automata are definable which have the ability to reproduce any finite pattern contained in the tessellation space. This note shows that the same construction may be applied to tessellation spac