(eng) We show here a natural extension of finite graph automata, by allowing each node of a network to store in its memory some pieces of information that are only bounded by the size of the underlying network (like a ...

(eng) Graph automata were first introduced by P. Rosenstiehl. A. Wu and A. Rosenfeld showed later how a graph automaton can study its own structure, by building a system of signals that explore the underlying graph, giving ...

(eng) We present a linear time algorithm for the networking and distributed computing problem of leader election (LE). Given a graph, its vertices represent processors (here finite state machines), and its edges communication ...

(eng) In this article, we start by presenting some basic definitions, some new notions about regularity as well as a topology on the set of tilings. From there, after the study of a new structure on the tiling sets, we ...