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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
In this paper, we study the properties of some elementary automata. We have obtained the characteristics of these cellular… 
2014
2014
Quantum-dot cellular automaton (QCA) is a novel nanotechnology that provides a very different computation platform than… 
2012
2012
This work focuses on the set of 32 legal Elementary Cellular Automata. We perform an exhaustive study of the systems’ response… 
2009
2009
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics… 
Review
2007
Review
2007
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
Cellular Automata are considered to be discrete dynamical systems as well as computing systems. Spectral analysis has been… 
2001
2001
S. Wolfram initiated the use of formal languages and automata theory in study of cellular automata (CAs). By means of extensive… 
1995
1995
Cellular automata (CA) are dynamical systems in which space and time are discrete, where each cell obeys the same rule and has a…