Sciweavers

14 search results - page 2 / 3
» Molecules as Automata
Sort
View
IJFCS
2006
130views more  IJFCS 2006»
13 years 4 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
ISMB
1993
13 years 6 months ago
Minimizing Complexity in Cellular Automata Models of Self-Replication
Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...
James A. Reggia, Hui-Hsien Chou, Steven L. Armentr...
DFT
2005
IEEE
81views VLSI» more  DFT 2005»
13 years 10 months ago
Modeling QCA Defects at Molecular-level in Combinational Circuits
This paper analyzes the deposition defects in devices and circuits made of Quantum-dot Cellular Automata (QCA) for molecular implementation. Differently from metal-based QCA, in ...
Mariam Momenzadeh, Marco Ottavi, Fabrizio Lombardi
LATA
2009
Springer
13 years 11 months ago
Bounded Hairpin Completion
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
Masami Ito, Peter Leupold, Victor Mitrana
GLVLSI
2005
IEEE
110views VLSI» more  GLVLSI 2005»
13 years 10 months ago
QCA channel routing with wire crossing minimization
Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemica...
Brian Stephen Smith, Sung Kyu Lim