Pattern reproduction in tessellation automata of arbitrary dimension

  • Authors:
  • Thomas J. Ostrand

  • Affiliations:
  • -

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 1971

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.