Tessellation structures for reproduction of arbitrary patterns

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

Serafino Amoroso, Gerald Cooper

Publication date: 1971

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

Mathematics Subject Classification ID

68T10: Pattern recognition, speech recognition

68Q80: Cellular automata (computational aspects)

Related Items

REPLICATION PROPERTIES OF PARITY CELLULAR AUTOMATA, The constructibility of a configuration in a cellular automaton, Cellular automata can generate fractals, Cellular automata and multifractals: Dimension spectra of linear cellular automata, Linear cellular automata over \(Z_ m\), The equality of fractional dimensions for certain cellular automata, Computing fractal dimensions for additive 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, Pattern reproduction in tessellation automata of arbitrary dimension

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