Tessellation structures for reproduction of arbitrary patterns
Journal of Computer and System Sciences
Reproduction in tessellation structures
Journal of Computer and System Sciences
The constructibility of a configuration in a cellular automaton
Journal of Computer and System Sciences
Another proof of the theorem on pattern reproduction in tessellation structures
Journal of Computer and System Sciences
Cellular automata and the quest for nontrivial artificial self-reproduction
CMC'10 Proceedings of the 11th international conference on Membrane computing
Hi-index | 0.00 |
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 spaces of any finite dimension.