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
Tessellation structures for reproduction of arbitrary patterns
โ Scribed by Serafino Amoroso; Gerald Cooper
- Publisher
- Elsevier Science
- Year
- 1971
- Tongue
- English
- Weight
- 533 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
โฆ Synopsis
For an arbitrary state alphabet A, one-and two-dimensional tessellation structures are defined that have the ability to reproduce any finite pattern (formed from the symbols in A) in the sense of Moore . The reproduced patterns will occur in quiescent environments if # A is prime.
๐ SIMILAR VOLUMES
After demonstrating the existence of nontrivial information lossless parallel maps on one-dimensional iterative array configurations, algorithms are presented for deciding the injectivity or surjectivity of the global maps given their defining local maps. Whether or not these properties are independ
This paper presents the theoretical foundation of the geometry capture technique. Geometry capture facilitates user-parameterization, through graphical means, of arbitrary 2D and 3D geometrical structures. This makes it possible to optimize the shape and dimensions of geometrical objects in an autom