Corpus ID: 14299135

Decomposition of Additive CA

@inproceedings{Sutner2002DecompositionOA,
  title={Decomposition of Additive CA},
  author={Klaus Sutner},
  year={2002}
}
We consider finite additive cellular automata with fixed and periodic boundary conditions as endomorphisms over pattern spaces. A characterization of the nilpotent and regular parts of these endomorphisms is given in terms of their minimal polynomials. We determine the generalized eigenspace decomposition, and describe relevant cyclic subspaces in terms of symmetries. As an application, we calculate the lengths and frequencies of limit cycles in the transition diagram of the automaton. 

Figures from this paper

automata: a hybrid system for computational automata theory
We present a system that performs computations on finite state machines, syntactic semigroups, and one-dimensional cellular automata.

References

SHOWING 1-10 OF 18 REFERENCES
Linear cellular automata with boundary conditions
The main results of the paper concern graphs of linear cellular automata with boundary conditions. We show that the connected components of such graphs are direct sums of trees and cycles, and weExpand
Classifying circular cellular automata
We introduce a hierarchy of linear cellular automata based on their limiting behavior on spatially periodic configurations. We show that it is undecidable to which class in the hierarchy a cellularExpand
Algebraic properties of cellular automata
Cellular automata are discrete dynamical systems, of simple construction but complex and varied behaviour. Algebraic techniques are used to give an extensive analysis of the global properties of aExpand
- Automata and Chebyshev-PolynomialsKlaus
A-automaton is a simple additive, binary cellular automaton on a graph. For product graphs such as a grids and cylinders, reversibility and periodicity properties of the corresponding automaton canExpand
On the Computational Complexity of Finite Cellular Automata
  • Klaus Sutner
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1995
TLDR
The problem of deciding whether a configuration has a predecessor is shown to be NLOG-complete for one-dimensional cellular automata, and the question whether a target configuration occurs in the orbit of a source configuration may be P- complete, NP-complete or PSPACE-complete, depending on the type of cellular automaton. Expand
Computation theoretic aspects of cellular automata
Abstract Cellular automata may be viewed as computational models of complex systems. They also can be seen as continuous functions on a particular family of compact metric spaces. This paper surveysExpand
FINITE FIELDS
This handout discusses finite fields: how to construct them, properties of elements in a finite field, and relations between different finite fields. We write Z/(p) and Fp interchangeably for theExpand
Algebraic coding theory
  • E. Berlekamp
  • Computer Science
  • McGraw-Hill series in systems science
  • 1968
This is the revised edition of Berlekamp's famous book, "Algebraic Coding Theory," originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineeringExpand
Shift Register Sequences
TLDR
The Revised Edition of Shift Register Sequences contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences. Expand
Theoretical Computer Science
TLDR
The Fully Mixed Nash Equilibrium Conjecture is valid for pure Nash equilibria and that under a certain condition, the social cost of any Nash equilibrium is within a factor of 6 + ε, of that of the fully mixed Nash equilibrium, assuming that link capacities are identical. Expand
...
1
2
...