Certain relations between properties of maps of tessellation automata

DOI10.1016/S0022-0000(77)80002-0zbMath0379.94068MaRDI QIDQ1247296

Namio Honda, Tadakazu Sato

Publication date: 1977

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other designs, configurations (05B30) General systems (93A10) Combinatorial aspects of tessellation and tiling problems (05B45) Stability of control systems (93D99)

Related Items (12)

Group structured linear cellular automata over \(Z_ m\) ⋮ Surjective linear cellular automata over \({\mathbb{Z}}_{m}\) ⋮ Ergodicity of linear cellular automata over \({\mathbb Z}_{m}\) ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Linear cellular automata on Cayley graphs ⋮ Local maps inducing surjective global maps of one-dimensional tessellation automata ⋮ Injectivity and surjectivity of parallel maps for cellular automata ⋮ Decidability for some problems of linear cellular automata over finite commutative rings ⋮ Ergodic characterization of linear cellular automata over \(Z_{m}\) ⋮ Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems ⋮ Linear cellular automata over \(Z_ m\) ⋮ Invertible cellular automata: A review

Cites Work

• Unnamed Item
• Dynamical systems: Stability theory and applications
• 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
• Condition for injectivity of global maps for tessellation automata
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Tessellation Automata
• Endomorphisms and automorphisms of the shift dynamical system
• The Garden-of-Eden Theorem for Finite Configurations
• The automorphisms of the shift dynamical system are relatively sparse
• The shift and commutativity
• Structural and behavioral equivalences of tessellation automata

This page was built for publication: Certain relations between properties of maps of tessellation automata