Weak gardens of Eden for 1-dimensional tessellation automata
If T is the parallel map associated with a 1-dimensional tessellation automaton, then we say a configuration f is a weak Garden of Eden for T if f has no pre-image under T other than a shift of itself. Let WG(T)= the set of weak Gardens of Eden for T and G(T)= the set of Gardens of Eden (i.e., the s...
Saved in:
Main Author: | Michael D. Taylor |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1985-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171285000631 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Encryption based on reversible cellular automata
by: PING Ping, et al.
Published: (2008-01-01) -
Development of a formalism of movable cellular automaton method for numerical modeling of fracture of heterogeneous elastic-plastic materials
by: S. Psakhie, et al.
Published: (2013-03-01) -
Development of a formalism of movable cellular automaton method for numerical modeling of fracture of heterogeneous elastic-plastic materials
by: S. Psakhie, et al.
Published: (2013-03-01) -
Discrete versus continual description of solid state reaction dynamics from the
angle of meaningful simulation
by: A. Korobov
Published: (2000-01-01) -
Block cipher based on T-shaped cellular automata
by: WU Ying-zhi1, et al.
Published: (2009-01-01)