Decomposable maps in general tessellation structures

DOI10.1016/0022-0000(79)90047-3zbMATH Open0409.68033OpenAlexW2058882682MaRDI QIDQ1259166FDOQ1259166

Authors: Jon T. Butler 

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0022-0000(79)90047-3

zbMATH Keywords

Decomposability of Parallel Maps in Tessellation Structures

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Cellular automata (computational aspects) (68Q80)

Cites Work

• Title not available (Why is that?)
• Cellular automata complexity trade-offs
• Indecomposable parallel maps in tessellation structures
• Structural and behavioral equivalences of tessellation automata
• Tessellation Automata
• Synthesis of one-dimensional binary cellular automata systems from composite local maps

Cited In (1)

• Indecomposable maps in tesselation structures of arbitrary dimension

This page was built for publication: Decomposable maps in general tessellation structures

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