2001
DOI: 10.1016/s0024-3795(00)00227-5
|View full text |Cite
|
Sign up to set email alerts
|

Linear cellular automata with boundary conditions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…This is called a cylindrical cellular automata [77] because evolution of the rule can be represented as taking place on a cylinder. If the lattice is isomorphic to f0; : : : ; n 1g, null, or Dirchlet boundary conditions are set [78,79,80]. That is, the symbol assigned to all sites in L outside of this set is the null symbol.…”
Section: Boundary Conditions and Additivitymentioning
confidence: 99%
“…This is called a cylindrical cellular automata [77] because evolution of the rule can be represented as taking place on a cylinder. If the lattice is isomorphic to f0; : : : ; n 1g, null, or Dirchlet boundary conditions are set [78,79,80]. That is, the symbol assigned to all sites in L outside of this set is the null symbol.…”
Section: Boundary Conditions and Additivitymentioning
confidence: 99%
“…Σ N is a group under coordinatewise addition (mod N ), and some c.a. are group endomorphisms of this group; these are the linear cellular automata whose jointly periodic points were studied in [24] and later in a number of papers (see [9,10,15,21,26,31] and their references). The algebraic structure allowed a number theoretic description of the way that f -periods of jointly periodic points of S N period n vary (irregularly) with n. We show now that when f is a linear c.a., it is easy to see that ν(f, S N ) = log N .…”
Section: Some Mechanisms For Periodicitymentioning
confidence: 99%
“…In the case f is linear (f (x) + f (y) = f (x + y)), Martin, Odlyzko and Wolfram [24] (see also the further work in [9,10,15,21,26,31] and their references) gave an algebraic analysis of f -periods and preperiods for points of a given shift period, and also provided some numerical data. One key feature for linear f is an easy observation: among the jointly periodic points of shift period k, there will be a point (generally many points) whose least f -period will be an integer multiple of all the least f -periods of the jointly periodic points of shift period k. In contrast, a very special case of a powerful theorem of Ashley [1] has the following statement: for any K, N and any shift-commuting map g from ∪ 1≤k≤K P k (S N ) to itself, there will exist surjective c.a.…”
Section: Definitions and Backgroundmentioning
confidence: 99%
See 2 more Smart Citations