3 search results - page 1 / 1 » Gardens of Eden and Fixed Points in Sequential Dynamical Sys... |
DMCCG
2001
Springer
13 years 9 months ago
2001
Springer
UC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
COMBINATORICS
2006
13 years 4 months ago
2006
The rules of "Bulgarian solitaire" are considered as an operation on the set of partitions to induce a finite dynamical system. We focus on partitions with no preimage u...