Results 1  10
of
92
6. Intel Supercomputer 22. Cellular Automata
"... Each student in the class will choose a topic related to computer architecture and prepare a term paper according to the outline given below. You are free to choose your own topic. To do so, write a paragraph describing the topic and submit it to the instructor for approval. You may not do the same ..."
Abstract
 Add to MetaCart
Each student in the class will choose a topic related to computer architecture and prepare a term paper according to the outline given below. You are free to choose your own topic. To do so, write a paragraph describing the topic and submit it to the instructor for approval. You may not do the same topic as one being done by another student. (In some cases, topics can be suitably modified so that you could be working on the same processor but a different aspect of the architecture.) If you do not choose a topic, one will be assigned by the instructor. A list of possible topics is given below:
2.2 Cellular automata and limit sets................ 5
, 2009
"... subshifts are the limit set of a ..."
22nd IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems On the Error Effects of Random Clock Shifts in Quantumdot Cellular Automata Circuits
"... This paper analyzes the effect of random phase shifts in the underlying clock signals on the operation of several basic Quantumdot Cellular Automata (QCA) building blocks. Such phase shifts can result from manufacturing variations or from uneven path lengths in the clocking network. While previous ..."
Abstract
 Add to MetaCart
This paper analyzes the effect of random phase shifts in the underlying clock signals on the operation of several basic Quantumdot Cellular Automata (QCA) building blocks. Such phase shifts can result from manufacturing variations or from uneven path lengths in the clocking network. While previous
Classifying Cellular Automata Automatically; Finding gliders, filtering, and relating spacetime patterns, attractor basins, and the Z parameter
 Complexity
, 1998
"... CA rules can be classied automatically for a spectrum of ordered, complex and chaotic dynamics, by a measure of the variance of inputentropy over time. Rules that support interacting gliders and related complex dynamics can be identied, giving an unlimited source for further study. The distribution ..."
Abstract

Cited by 67 (4 self)
 Add to MetaCart
the methods and presents results for 1d CA. 1 Introduction Cellular automata (CA) are a much stud...
From nondeterministic Büchi and Streett automata to deterministic parity automata
 In 21st Symposium on Logic in Computer Science (LICS’06
, 2006
"... Determinization and complementation are fundamental notions in computer science. When considering finite automata on finite words determinization gives also a solution to complementation. Given a nondeterministic finite automaton there exists an exponential construction that gives a deterministic au ..."
Abstract

Cited by 74 (5 self)
 Add to MetaCart
that result in deterministic Rabin automata. For a Büchi automaton with n states, Safra constructs a deterministic Rabin automaton with n O(n) states and n pairs. For a Streett automaton with n states and k pairs, Safra constructs a deterministic Rabin automaton with (nk) O(nk) states and n(k + 1) pairs. Here
Cellular Automata as Languages Recognizers
, 1998
"... Language recognition is a powerful tool to evaluate the computational power of devices. In case of cellular automata, a specific problematics appears in the one dimensional case where the space is bounded. A state of the art is presented. In the two dimensional case, few results are known. The main ..."
Abstract
 Add to MetaCart
cellulaires, r'eseaux systoliques, reconnaissance de langages, complexit'e. Cellular Automata as Languages Recognizers Marianne Delorme Jacques Mazoyer 22nd July ...
Lectures on Reliable Cellular Automata
"... . These notes are selfcontained. Some acquaintance with elementary probability theory and computation theory (Turing machines) is required. The topics are (with the omission of the words \reliable" from each one): Introduction (30 min) Boolean circuits (30 min) Informationstorage circ ..."
Abstract
 Add to MetaCart
storage circuits (60 min) Cellular automata (60 min) Toom's rule and its application (60 min) Hierarchical codes (60 min) Simulation, universality, correcting single errors (60 min) Media and ampliers (60 min) The program and its proof (60 min) Selforganization (60 min) Applications and open
ORDER INDEPENDENCE IN ASYNCHRONOUS CELLULAR AUTOMATA
"... ABSTRACT. A sequential dynamical system, or SDS, consists of an undirected graph Y, a vertexindexed list of local functions FY, and a word ω over the vertex set, containing each vertex at least once, that describes the order in which these local functions are to be applied. In this article we invest ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
investigate the special case where Y is a circular graph with n vertices and all of the local functions are identical. The 256 possible local functions are known as Wolfram rules and the resulting sequential dynamical systems are called finite asynchronous elementary cellular automata, or ACAs, since
■ Cellular telephonesNXP Semiconductors
, 2007
"... The PCA8575 provides general purpose remote I/O expansion for most microcontroller families via the twoline bidirectional I 2 Cbus (serial clock (SCL), serial data (SDA)). The device consists of a 16bit quasibidirectional port and an I 2 Cbus interface. The PCA8575 has a low current consumption ..."
Abstract
 Add to MetaCart
the microcontroller if there is incoming data on its ports without having to communicate via the I 2 Cbus. The internal PowerOn Reset (POR) initializes the I/Os as inputs. ■ 400 kHz I 2 Cbus interface ■ 2.3 V to 5.5 V operation with 5.5 V tolerant I/Os ■ 16bit remote I/O pins that default to inputs at power
SeckTuohMora: Phenomenology of reactiondiffusion binarystate cellular automata
 Int. J. Bifurcation and Chaos
, 2006
"... We study a binarycellstates eightcell neighborhood twodimensional cellular automaton model of a quasichemical system with a substrate and a reagent. Reactions are represented by semitotalistic transitions rules: every cell switches from state 0 to state 1 depending on if sum of neighbors in st ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
We study a binarycellstates eightcell neighborhood twodimensional cellular automaton model of a quasichemical system with a substrate and a reagent. Reactions are represented by semitotalistic transitions rules: every cell switches from state 0 to state 1 depending on if sum of neighbors
Results 1  10
of
92