KURKA , Petr

A subshift attractor is a two-sided subshift which is an attractor of a cellular automaton. We prove that each subshift attractor is chain-mixing, contains a configuration which is both F-periodic and $\sigma$-periodic and the complement of its language is recursively enumerable. We prove that a subshift of finite type is an attractor of a...

We construct an algorithm which finds the maximal attractors (limit sets) of certain cellular automata whose maximal attractor is a sofic subshift. The algorithm first finds signal subshifts of a given automaton, constructs their join, and finally forward images of this join. When this procedure stops, the algorithm tests whether a special...

We present recent studies on cellular automata (CAs) viewed as discrete dynamical systems. In the first part, we illustrate the relations between two important notions: subshift attractors and signal subshifts, measure attractors and particle weight functions. The second part of the chapter considers some operations on the space of...

We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Then the algorithms searches for the corresponding subshift attractors (which are omega-limits of spreading sets found) as forward images of joins of signal subshifts.