A completeness problem for pattern generation in tessellation automata (Q2537975): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simple self-reproducing universal automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tessellation Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural and behavioral equivalences of tessellation automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5333602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Note: The Converse of Moore's Garden-of-Eden Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying framework for the theory of iterative arrays of machines / rank
 
Normal rank

Latest revision as of 00:21, 12 June 2024

scientific article
Language Label Description Also known as
English
A completeness problem for pattern generation in tessellation automata
scientific article

    Statements

    A completeness problem for pattern generation in tessellation automata (English)
    0 references
    1970
    0 references
    languages, automata, networks
    0 references
    0 references
    0 references

    Identifiers