A Geometrical Hierarchy on Graphs via Cellular Automata

• Autorzy: Martin B.
• Języki publikacji: EN

Abstrakty

EN

Historically, cellular automata were defined on the lattices \mathbbZn, but the definition can be extended to bounded degree graphs. Given a notion of simulation between cellular automata defined on different structures (namely graphs of automata), we can deduce an order on graphs. In this paper, we link this order to graph properties and explicit the order for most of the common graphs.

Słowa kluczowe

EN

cellular automata; graphs of automata

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2002
• Tom: Vol. 52, nr 1-3
• Strony: 157--181
• Opis fizyczny: wykr., bibliogr. 14 poz.

Twórcy

autor

Martin B.

• e-lab, Bouygues SA 1, av. Eugene Freyssinet 78061, Saint-Quentin en Yvelines France,