This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
Vincenzo Ciancia, Gian Luigi Ferrari, Marco Pistor...
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...
A method of constructing asynchronous cellular automata (ACA model) as a parallel composition of two interacting ACA is presented. The resulting ACA is intended to simulate a proce...
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...