✦ LIBER ✦

Tessellation Automata

✍ Scribed by H. Yamada; S. Amoroso

Book ID: 114036732
Publisher: Elsevier Science
Year: 1969
Weight: 918 KB
Volume: 14
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(69)90090-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planigon tessellation cellular automata

✍ Alexander Korobov 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 673 KB

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 crystallo

R70-32 Tessellation Automata

✍ Wagner, E.G. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 477 KB

Open maps for tessellation automata

✍ Akira Maruoka 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 810 KB

Indecomposable local maps of tessellatio

Indecomposable local maps of tessellation automata

✍ Masakazu Nasu 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 947 KB

Some comments on neighborhood size for t

Some comments on neighborhood size for tessellation automata

✍ S. Amoroso; R. Guilfoyle 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 341 KB

Pattern reproduction in tessellation aut

Pattern reproduction in tessellation automata of arbitrary dimension

✍ Thomas J. Ostrand 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 179 KB

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