139 search results - page 4 / 28 » How Common Can Be Universality for Cellular Automata |
156
click to vote
ACRI
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...
123
Voted
CSR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
155
click to vote
CAV
2006
Springer
15 years 8 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
141
click to vote
AUSAI
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents two novel features of an emergent data visualization method coined "cellular ants": unsupervised data class labeling and shape negotiation. This metho...
170
click to vote
DFT
2008
IEEE
15 years 10 months ago
2008
IEEE
Tolerating defects and fabrication variations will be critical in any system made with devices that have nanometer feature sizes. This paper considers how fabrication variations a...