Sciweavers

1279 search results - page 25 / 256
» Fast Implementations of Automata Computations
Sort
View
IJBC
2007
39views more  IJBC 2007»
13 years 7 months ago
Optimal CNN Templates for Linearly-Separable One-Dimensional Cellular Automata
In this tutorial, we present optimal Cellular Nonlinear Network (CNN) templates for implementing linearly-separable one-dimensional (1-D) Cellular Automata (CA). From the gallery ...
P. J. Chang, Bharathwaj Muthuswamy
DNA
2005
Springer
154views Bioinformatics» more  DNA 2005»
14 years 1 months ago
Design of Autonomous DNA Cellular Automata
Recent experimental progress in DNA lattice construction, DNA robotics, and DNA computing provides the basis for designing DNA cellular computing devices, i.e. autonomous nano-mech...
Peng Yin, Sudheer Sahu, Andrew J. Turberfield, Joh...
POPL
2010
ACM
13 years 10 months ago
Reconfigurable asynchronous logic automata: (RALA)
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...
ECCC
2000
75views more  ECCC 2000»
13 years 7 months ago
Deterministic Turing Machines in the Range between Real-Time and Linear-Time
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
Andreas Klein, Martin Kutrib
FOSSACS
2011
Springer
12 years 11 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi