Effective Simulations on Hyperbolic Networks

• Autorzy: Nichitiu C.M. , Rémila E.
• Języki publikacji: EN

Abstrakty

EN

We state a definition of the simulation of graph automata, which are machines built by putting copies of the same finite-state automaton at the vertices of a regular graph, reading the states of the neighbors. We first present the notion of simulation and link it to intrinsic graph properties. Afterwards, we present some results of simulation between such graph automata, comparing them to the cellular automata on Cayley graphs. The graphs considered here are planar, with the elementary cycles of the same length, and form regular tilings of the hyperbolic plane. We conclude with a possible speed hierarchy.

Słowa kluczowe

EN

cellular automata; graphs of automata; simulation; hyperbolic graphs; Cayley graphs

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

Twórcy

autor

Nichitiu C.M.

autor

Rémila E.

• EURISE, Univ.Jean Monet, 23, rue Michelon, 42023 St Etienne, France,