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
Indecomposable maps in tessellation structures of arbitrary dimension
β Scribed by Hiromi Miyajima; Masateru Harao; Shoichi Noguchi
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 589 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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.
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
## Abstract We give a number of characterizations of bodies of constant width in arbitrary dimension. As an application, we describe a way to construct a body of constant width in dimension __n__, one of its (__n__ β 1)βdimensional projection being given. We give a number of examples, like a fourβd