24 search results - page 3 / 5 » A Process-Theoretic Look at Automata |
CG
2010
Springer
13 years 5 months ago
2010
Springer
Cyclic cellular automata on the integer planar lattice are known to typically evolve through distinct phases ending with minimal periodic terminal states that usually appear as in...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
ENTCS
2007
13 years 6 months ago
2007
We provide a new look at formal aspects of component substitutability (replacement of a component with a new one) and independent implementability (reuse of a component in any sys...
FM
2006
Springer
13 years 9 months ago
2006
Springer
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...
ICCD
2008
IEEE
14 years 3 months ago
2008
IEEE
— This paper looks at designing circuit elements that will be constructed with nanoscale magnets within the Quantum-dot Cellular Automata (QCA) computational paradigm. In magneti...