Pattern decomposition for tessellation automata
From MaRDI portal
Publication:1158759
DOI10.1016/0304-3975(81)90043-8zbMath0473.68049OpenAlexW2017592668MaRDI QIDQ1158759
Akira 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
Cites Work
- Completeness problem of one-dimensional binary scope-3 tessellation automata
- A completeness property of one-dimensional tessellation automata
- A completeness problem for pattern generation in tessellation automata
- Tesselations with local transformations
- 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