Tessellation structures for reproduction of arbitrary patterns

DOI10.1016/S0022-0000(71)80009-0zbMath0223.94024WikidataQ56863604 ScholiaQ56863604MaRDI QIDQ2548237

Gerald Cooper, Serafino Amoroso

Publication date: 1971

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Cellular automata (computational aspects) (68Q80)

Related Items (17)

The equality of fractional dimensions for certain cellular automata ⋮ Computing fractal dimensions for additive cellular automata ⋮ Why it is sufficient to consider only the case where the seed of linear cellular automata is 1 ⋮ Cellular automata and multifractals: Dimension spectra of linear cellular automata ⋮ Calculating growth rates and moments for additive cellular automata ⋮ Self-similarity of linear cellular automata ⋮ Survey of research in the theory of homogeneous structures and their applications ⋮ Reproduction in tessellation structures ⋮ The behavioral properties of homogeneous structures ⋮ Another proof of the theorem on pattern reproduction in tessellation structures ⋮ A note on pattern reproduction in tessellation structures ⋮ The constructibility of a configuration in a cellular automaton ⋮ Pattern reproduction in tessellation automata of arbitrary dimension ⋮ REPLICATION PROPERTIES OF PARITY CELLULAR AUTOMATA ⋮ Cellular automata can generate fractals ⋮ Linear cellular automata over \(Z_ m\) ⋮ Replication of spatial patterns with reversible and additive cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• A unifying framework for the theory of iterative arrays of machines
• Simple self-reproducing universal automata
• A Model of Replication
• The Garden-of-Eden Theorem for Finite Configurations

This page was built for publication: Tessellation structures for reproduction of arbitrary patterns