Sciweavers

50 search results - page 8 / 10
» A Particular Universal Cellular Automaton
Sort
View
MFCS
2004
Springer
14 years 27 days ago
Captive Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Guillaume Theyssier
ECOOPW
1998
Springer
13 years 11 months ago
Development and Utilization of Parallel Generic Algorithms for Scientific Computations
We develop generic parallel algorithms as extensible modules that encapsulate related classes and parallel methods. Extensible modules define common parallel structures, such as m...
Atanas Radenski, A. Vann, Boyana Norris
FPGA
1992
ACM
176views FPGA» more  FPGA 1992»
13 years 11 months ago
Minimization of Permuted Reed-Muller Trees for Cellular Logic
The new family of Field Programmable Gate Arrays, CLI6000 from Concurrent Logic Inc realizes the truly Cellular Logic. It has been mainly designed for the realization of data path...
Li-Fei Wu, Marek A. Perkowski
STACS
2010
Springer
14 years 2 months ago
Intrinsic Universality in Self-Assembly
We show that the Tile Assembly Model exhibits a strong notion of universality where the goal is to give a single tile assembly system that simulates the behavior of any other tile...
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott...
BMCBI
2007
159views more  BMCBI 2007»
13 years 7 months ago
Computational genes: a tool for molecular diagnosis and therapy of aberrant mutational phenotype
Background: A finite state machine manipulating information-carrying DNA strands can be used to perform autonomous molecular-scale computations at the cellular level. Results: We ...
Israel Mark Martínez-Pérez, Gong Zha...