Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,323 papers from all fields of science
Search
Sign In
Create Free Account
Elementary cellular automaton
Known as:
Rule 54
, ECA
, Rule 190
Expand
In mathematics and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Cellular automaton
Conway's Game of Life
Reversible cellular automaton
Rule 110
Expand
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 †
A. Tatashev
,
M. Yashina
Machines
2019
Corpus ID: 155153004
In this paper, we study the properties of some elementary automata. We have obtained the characteristics of these cellular…
Expand
2014
2014
Novel Adder Circuits Based On Quantum-Dot Cellular Automata (QCA)
Firdous Ahmad
,
G. M. Bhat
,
Peer Zahoor Ahmad
2014
Corpus ID: 36743283
Quantum-dot cellular automaton (QCA) is a novel nanotechnology that provides a very different computation platform than…
Expand
2012
2012
A Study of Stochastic Noise and Asynchronism in Elementary Cellular Automata
Fernando Silva
,
L. Correia
International Conference on Cellular Automata for…
2012
Corpus ID: 36884116
This work focuses on the set of 32 legal Elementary Cellular Automata. We perform an exhaustive study of the systems’ response…
Expand
2012
2012
Robust periodic solutions and evolution from seeds in one-dimensional edge cellular automata
Janko Gravner
,
D. Griffeath
Theoretical Computer Science
2012
Corpus ID: 13556711
2011
2011
Multifractal analyses of row sum signals of elementary cellular automata
J. S. Murguía
,
H. Rosu
2011
Corpus ID: 118562004
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
Frederic P. Miller
,
Agnes F. Vandome
,
John McBrewster
2009
Corpus ID: 125676912
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics…
Expand
Review
2007
Review
2007
Automated IT service fault diagnosis based on event correlation techniques
A. Hanemann
2007
Corpus ID: 11658513
In the previous years a paradigm shift in the area of IT service management could be witnessed. IT management does not only deal…
Expand
2006
2006
1/f Noise in Elementary Cellular Automaton Rule 110
S. Ninagawa
International Conference on Unconventional…
2006
Corpus ID: 30855016
Cellular Automata are considered to be discrete dynamical systems as well as computing systems. Spectral analysis has been…
Expand
2001
2001
A complexity analysis of the elementary cellular automaton of rule 122
Zhisong Jiang
2001
Corpus ID: 119684416
S. Wolfram initiated the use of formal languages and automata theory in study of cellular automata (CAs). By means of extensive…
Expand
1995
1995
Quasi-Uniform Computation-Universal Cellular Automata
M. Sipper
European Conference on Artificial Life
1995
Corpus ID: 19004484
Cellular automata (CA) are dynamical systems in which space and time are discrete, where each cell obeys the same rule and has a…
Expand
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)
ACCEPT & CONTINUE