Completeness problem of one-dimensional binary scope-3 tessellation automata

DOI10.1016/S0022-0000(74)80036-XzbMath0292.94038MaRDI QIDQ1211956

Akira Maruoka, Masayuki Kimura

Publication date: 1974

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

A function for evaluating the computing time of a bubbling system ⋮ Pattern decomposition for tessellation automata ⋮ The behavioral properties of homogeneous structures ⋮ A completeness property of one-dimensional tessellation automata ⋮ Injectivity and surjectivity of parallel maps for cellular automata

Cites Work

• Unnamed Item
• A completeness problem for pattern generation in tessellation automata
• Simple self-reproducing universal automata

This page was built for publication: Completeness problem of one-dimensional binary scope-3 tessellation automata