Elementary cellular automaton

Known as: Rule 54, ECA, Rule 190 
In mathematics and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This paper presents a discussion of complex shift dynamics of some elementary cellular automaton rules (rules 30, 41, and 110… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Stochastic particle-like persistent structures are found in the class 3 elementary cellular automaton rule number 146. These… (More)
Is this relevant?
2010
2010
This paper presents the characterization of Rule 110 as a block substitution system of three symbols. Firstly, it is proved that… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2009
2009
The fundamental nature of an evolving one-dimensional (1D) Ising model is investigated with an elementary cellular automaton (CA… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
This paper examines the chaotic properties of the elementary cellular automaton rule 40. Rule 40 has been classified into Wolfram… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The purpose of this paper is to prove that one of the simplest one dimensional cellular automata is computationally universal… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
Cellular automata are classes of mathematical systems characterized by discreteness (in space, time, and state values… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Since Richard Feynman introduced the notion of quantum computation in 1982, various models of \quantum computers" have been… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The structure of th e elementary cellular automata rule space is investigated. The probabiliti es for a rule to be connected to… (More)
  • figure 1
  • figure 2
  • table 2
  • table 3
  • figure 3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A l-dimensional cellular automaton which generates random sequences is discussed. Each site in the cellular automaton has value 0… (More)
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 4.1
  • figure 5.1
Is this relevant?