Sciweavers

171 search results - page 18 / 35
» On the Power of Tree-Walking Automata
Sort
View
CEC
2005
IEEE
13 years 11 months ago
Graph composition in a graph grammar-based method for automata network evolution
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
Martin H. Luerssen, David M. W. Powers
ET
2007
61views more  ET 2007»
13 years 9 months ago
Reliability and Defect Tolerance in Metallic Quantum-dot Cellular Automata
The computational paradigm known as quantum-dot cellular automata (QCA) encodes binary information in the charge configuration of Coulomb-coupled quantum-dot cells. Functioning QC...
Mo Liu, Craig S. Lent
VMCAI
2010
Springer
14 years 4 months ago
Regular Linear Temporal Logic with Past
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
César Sánchez, Martin Leucker
CONCUR
2005
Springer
14 years 3 months ago
A New Modality for Almost Everywhere Properties in Timed Automata
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
Houda Bel Mokadem, Béatrice Bérard, ...
ISVLSI
2003
IEEE
138views VLSI» more  ISVLSI 2003»
14 years 3 months ago
Bouncing Threads: Merging a New Execution Model into a Nanotechnology Memory
The need for small, high speed, low power computers as the end of Moore’s law approaches is driving research into nanotechnology. These novel devices have significantly differe...
Sarah E. Frost, Arun Rodrigues, Charles A. Giefer,...