Pages that link to "Item:Q2537975"

The following pages link to A completeness problem for pattern generation in tessellation automata (Q2537975):

Displaying 12 items.

• The constructibility of a configuration in a cellular automaton (Q758953) (← links)
• An interconnection of local maps inducing onto global maps (Q1139933) (← links)
• Pattern decomposition for tessellation automata (Q1158759) (← links)
• Completeness problem of one-dimensional binary scope-3 tessellation automata (Q1211956) (← links)
• Survey of research in the theory of homogeneous structures and their applications (Q1214256) (← links)
• The behavioral properties of homogeneous structures (Q1228468) (← links)
• A completeness property of one-dimensional tessellation automata (Q1230776) (← links)
• Certain relations between properties of maps of tessellation automata (Q1247296) (← links)
• Injectivity and surjectivity of parallel maps for cellular automata (Q1259427) (← links)
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures (Q2561573) (← links)
• Indecomposable local maps of tessellation automata (Q3856103) (← links)
• The Garden-of-Eden Theorem for Finite Configurations (Q5623670) (← links)