346 search results - page 32 / 70 » Determinizing Asynchronous Automata |
104
click to vote
LATA
2010
Springer
15 years 2 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
IANDC
2011
14 years 5 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
A non-uniform cellular automata-based model is presented for the evolutionary development of digital circuits at the gate level. The main feature of this model is the modified lo...
CEC
2005
IEEE
15 years 1 days ago
2005
IEEE
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...
AUSAI
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents two novel features of an emergent data visualization method coined "cellular ants": unsupervised data class labeling and shape negotiation. This metho...