![]() ![]() Signal subshifts are of nite type, can be easily computed, and are contained in the maximal attractor. A signal subshift (see ) consists of congurations which after certain time reappear shifted. In we have developed a method which searches for the maximal attractor of a CA in the form of a forward image of join of signal subshifts. However, to nd all spreading sets of a given CA and to determine the structure of the corresponding subshifts attractors is not always an easy task. Into simple combinatorial properties of these word sets. ![]() ZahradnkFaculty of Mathematics and Physics, Charles University in Prague, Malostransk nmst 25, 11800 Praha 1, Czech Republic KrkaCenter for Theoretical Study, Academy of Sciences and Charles University in Prague, Jilsk 1, 11000 Praha 1, Czech Republic Laboratoire I3S, Universit de Nice-Sophia Antipolis, 2000, route des Lucioles, Les Algorithmes, bt Euclide B, BP 121, 06903 Sophia Antipolis Cedex, Francee-mail: Clopen sets can be represented by nite sets of words, and the properties of invariance and spreading translate If the attractor is a subshift, the clopen set must be not only invariant but also spreading both to the left and to the right. An attractor is the omega-limit of a clopen invariant set. The special case of maximal attractor, or omega-limit set has been one of the most intensively studied structures of cellular automata theory (see e.g., or ). The concept of attractor and of subshift attractor in particular is essential for understanding the dynamics of cellular automata (see ). Keywords Soc subshifts Subshift attractors Spreading sets Signal subshifts 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. Published online: 1 August 2009 Springer Science+Business Media, LLC 2009Ībstract We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Theory Comput Syst (2010) 46: 479498 DOI 10.1007/s0022-6Ī Search Algorithm for Subshift Attractors of Cellular Automata
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |