A completeness problem for pattern generation in tessellation automata

DOI10.1016/S0022-0000(70)80005-8zbMath0191.31006MaRDI QIDQ2537975

Serafino Amoroso, Hisao Yamada

Publication date: 1970

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

zbMATH Keywords

languages, automata, networks

Related Items (12)

An interconnection of local maps inducing onto global maps ⋮ Pattern decomposition for tessellation automata ⋮ The Garden-of-Eden Theorem for Finite Configurations ⋮ Completeness problem of one-dimensional binary scope-3 tessellation automata ⋮ Survey of research in the theory of homogeneous structures and their applications ⋮ Indecomposable local maps of tessellation automata ⋮ The behavioral properties of homogeneous structures ⋮ A completeness property of one-dimensional tessellation automata ⋮ Certain relations between properties of maps of tessellation automata ⋮ Injectivity and surjectivity of parallel maps for cellular automata ⋮ The constructibility of a configuration in a cellular automaton ⋮ Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

Cites Work

• 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
• Tessellation Automata
• Structural and behavioral equivalences of tessellation automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A completeness problem for pattern generation in tessellation automata