Additive Automata On Graphs
نویسنده
چکیده
A bstract. We study cellular automata. with addi tive rules on finite undi rected graphs. The addition is carried out in some finite abelian mono id. We investigate the prob lem of deciding wheth er a given configuration has a predecessor . Depending on th e underlying monoid this prob lem is solvable in polynomial time or NP-complete. Furt hermo re, we st udy the global reversibility of cellular graph automata based on addition modulo two . We give a linear time algor ithm to decide reversibility of unicyclic graphs.
منابع مشابه
σ-Automata and Chebyshev-Polynomials
A σ-automaton is an additive, binary cellular automaton on a graph. For product graphs such as a grids and cylinders, reversibility and periodicity properties of the corresponding σautomaton can be expressed in terms of a binary version of Chebyshev polynomials. We will give a detailed analysis of the divisibility properties of these polynomials and apply our results to the study of σ-automata.
متن کاملOn the Measure Entropy of Additive Cellular Automata f∞
We show that for an additive one-dimensional cellular automata on space of all doubly infinitive sequences with values in a finite set S = {0, 1, 2, ..., r-1}, determined by an additive automaton rule f(x ∞ f n-k, ..., xn+k) = (mod r), and a -invariant uniform Bernoulli measure μ, the measure-theoretic entropy of the additive one-dimensional cellular automata with respect to μ is equal to h ∑ −...
متن کاملA Geometrical Hierarchy on Graphs via Cellular Automata
Historically, cellular automata were deened on the lattices Z n , but the deenition can be extended to bounded degree graphs. Given a notion of simulation between cellular automata deened on diierent structures (namely graphs of automata), we can deduce an order on graphs. In this paper, we link this order to graph properties and explicit the order for most of the common graphs. R esum e Histor...
متن کاملLifts, derandomization, and diameters of Schreier graphs of Mealy automata
It is known that random 2-lifts of graphs give rise to expander graphs. We present a new conjectured derandomization of this construction based on certain Mealy automata. We verify that these graphs have polylogarithmic diameter, and present a class of automata for which the same is true. However, we also show that some automata in this class do not give rise to expander graphs.
متن کاملIsomorphisms of Additive Cellular Automata on Finite Groups
We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such as the index-group, monoid of automata rules, and its subgroup of reversible elements). However for some groups there exist not regular automata isomorphism...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 2 شماره
صفحات -
تاریخ انتشار 1988