Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Cellular automatonConway's Game of LifeReversible cellular automatonRule 110

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Spectrum of Elementary Cellular Automata and Closed Chains of Contours †
In this paper, we study the properties of some elementary automata. We have obtained the characteristics of these cellular… 
2014
2014
Novel Adder Circuits Based On Quantum-Dot Cellular Automata (QCA)
Quantum-dot cellular automaton (QCA) is a novel nanotechnology that provides a very different computation platform than… 
2012
2012
A Study of Stochastic Noise and Asynchronism in Elementary Cellular Automata
This work focuses on the set of 32 legal Elementary Cellular Automata. We perform an exhaustive study of the systems’ response… 
2012
2012
Robust periodic solutions and evolution from seeds in one-dimensional edge cellular automata
2011
2011
Multifractal analyses of row sum signals of elementary cellular automata
2009
2009
Cellular automaton: Elementary cellular automaton, Brian's Brain, Conway's Game of Life, Langton's ant, Rule 90, Rule 110, Rule 184, Codd's cellular automaton
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics… 
Review
2007
Review
2007
Automated IT service fault diagnosis based on event correlation techniques
In the previous years a paradigm shift in the area of IT service management could be witnessed. IT management does not only deal… 
2006
2006
1/f Noise in Elementary Cellular Automaton Rule 110
Cellular Automata are considered to be discrete dynamical systems as well as computing systems. Spectral analysis has been… 
2001
2001
A complexity analysis of the elementary cellular automaton of rule 122
S. Wolfram initiated the use of formal languages and automata theory in study of cellular automata (CAs). By means of extensive… 
1995
1995
Quasi-Uniform Computation-Universal Cellular Automata
Cellular automata (CA) are dynamical systems in which space and time are discrete, where each cell obeys the same rule and has a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)