Abstract
We present an algorithm which finds the maximal attractor of some cellular automata whose maximal attractor is a sofic subshift. The algorithm finds signal subshifts, construCentrum pro teoretická studia their join and forward images of the join.
If this procedure stops, the algorithm tests whether a special condition of decreasing preimages is satisfied. If so, the maximal attractor is obtained