Defect particle kinematics in one-dimensional cellular automata

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Defect particle kinematics in one-dimensional cellular automata

Let A be the Cantor space of bi-infinite sequences in a finite alphabet A, and let σ be the shift map on A. A cellular automaton is a continuous, σ-commuting self-map Φ of A, and a Φ-invariant subshift is a closed, (Φ, σ)-invariant subset S ⊂ A. Suppose a ∈ A is S-admissible everywhere except for some small region we call a defect. It has been empirically observed that such defects persist unde...

متن کامل

Local Information in One-Dimensional Cellular Automata

A local information measure for a one-dimensional lattice system is introduced, and applied to describe the dynamics of one-dimensional cellular automata.

متن کامل

Signals in One-Dimensional Cellular Automata

In this paper, we are interested in signals, form whereby the data can be transmitted in a cellular automaton. We study generation of some signals. In this aim, we i n vestigate a notion of constructibility of increasing functions related to the production of words on the initial cell (in the sense of Fischer for the prime numbers). We establish some closure properties on this class of function...

متن کامل

Boundary growth in one-dimensional cellular automata

We systematically study the boundaries of one-dimensional, 2color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries that appear to be reducible. Morphic words characterize the reducible boundaries. For boundaries that appear to be irreducible, we apply curve-fitting techniques to compute an empirical growth expone...

متن کامل

Growing Patterns in One Dimensional Cellular Automata

We st udy limi t evolut ions of cellular automata (CA) both theoretically and exp erimentally. We show that eit her all orbits ente r the limit set after less than a finit ely bo unded number of states, or almost all orbits never ent er the limit set . We link this result with a class ification of CAs according to their limit behavior due to Culik et al.: in t he first case, the considered CA b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2007

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2007.03.014