Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Cyclic cellular automaton

Known as: CCA, Cyclic space cellular automaton 
The cyclic cellular automaton is a cellular automaton rule developed by David Griffeath and studied by several other cellular automaton researchers… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Abstract Reversibility of cellular automata (CA) has been an extensively studied problem from both a theoretical and a practical… Expand
2012
2012
ABSTRACT Following Baryshnikov-Coffman-Kwak [1], we use network cyclic cellular automata to generate a decentralized protocol… Expand
2011
2011
Wireless Sensor Network is a collection of micro sensors which are gathering data in various situations from monitoring… Expand
  • figure 6
2010
2010
Cyclic cellular automata on the integer planar lattice are known to typically evolve through distinct phases ending with minimal… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2008
2008
Our contribution in this paper is a scalable, easily implemented, self-organizing, energy conserving intruder- detection sensor… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2008
2008
Cyclic cellular automata (CCAs) have been found to provide a natural, beguilingly simple, and elegant infrastructure for the… Expand
  • figure 2
  • figure 1
2007
2007
Introduction Polymerization products of methyl methacrylate (MMA) have been used in various fields, such as dentistry in denture… Expand
  • figure 1
  • table 1
  • figure 2
2001
2001
Voltammetric studies of rabbit liver metallothioneins (MTs) adsorbed onto thin mercury films preformed onto glassy carbon… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
1993
1993
We study two families of excitable cellular automata known as the Greenberg-Hastings model and the cyclic cellular automaton… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
1990
1990
Consider a cellular automaton defined on ~ where each lattice site may take on one of N values, referred to as colors. The N… Expand