Pattern decomposition for tessellation automata

DOI10.1016/0304-3975(81)90043-8MaRDI QIDQ1158759zbMATH OpenOpenAlexFDO

Authors A. Maruoka, Masayuki Kimura, Nobuyoshi Shoji

Publication date 1981

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(81)90043-8

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites work

• A completeness problem for pattern generation in tessellation automata
• A completeness property of one-dimensional tessellation automata
• Completeness problem of one-dimensional binary scope-3 tessellation automata
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Decomposition phenomenon in one-dimensional scope-three tessellation automata with arbitrary number of states
• Tesselations with local transformations

This page was built for publication: Pattern decomposition for tessellation automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158759)