Parity Filter Automata
نویسنده
چکیده
Parity filter automata are a class of two-st a te cellular aut omata on the intege r grid po ints of t he real line in which cells are updated serially from left to right in each time period ra.ther than 5YOchronously in parallel. Parity filter auto mata support large numbers of "par ticles," or persistent repeating configurations, and the collision of these particles is frequently a. "soliton" collision in which the particles in teract , bu t from which both emerge with t heir identit ies preser ved . This paper presen ts a theory of such par ity filter automata . Period and velocity theo rems for particles, existence and uniqueness theorems, conser vation and monotone nonconservation laws, durat ion and phase shifts in soliton collisions, and other results are proved.
منابع مشابه
Generic parity generators design using LTEx methodology: A quantum-dot cellular automata based approach
Quantum-dot Cellular Automata (QCA) is a prominent paradigm that is considered to continue its dominance in thecomputation at deep sub-micron regime in nanotechnology. The QCA realizations of five-input Majority Voter based multilevel parity generator circuits have been introduced in recent years. However, no attention has been paid towards the QCA instantiation of the generic (n-bit) even and ...
متن کاملGeneric parity generators design using LTEx methodology: A quantum-dot cellular automata based approach
Quantum-dot Cellular Automata (QCA) is a prominent paradigm that is considered to continue its dominance in thecomputation at deep sub-micron regime in nanotechnology. The QCA realizations of five-input Majority Voter based multilevel parity generator circuits have been introduced in recent years. However, no attention has been paid towards the QCA instantiation of the generic (n-bit) even and ...
متن کاملDeterminising Parity Automata
Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the intermediate determinisation to Rabin automata is optimal. We show that the resulting determinisation to parity automata is optimal up to a sm...
متن کاملRamsey-Based Analysis of Parity Automata
Parity automata are a generalisation of Büchi automata that have some interesting advantages over the latter, e.g. determinisability, succinctness and the ability to express certain acceptance conditions like the intersection of a Büchi and a co-Büchi condition directly as a parity condition. Decision problems like universality and inclusion for such automata are PSPACE-complete and have origin...
متن کاملEmbedding Computation in One-Dimensional Automata by Phase Coding Solitons
Abstrucf-We show that some kind of meaningful computation can be embedded in very simple, microscopically homogeneous, one-dimensional automata-filter automata with a parity next-state rule. A systematic procedure is given for generating moving, periodic structures (“particles”). These particles exhibit solitonlike properties; that is, they often pass through one another with phase shifts. We t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 2 شماره
صفحات -
تاریخ انتشار 1988