Cellular Graph Automata

Labelled graphs of bounded degree, with numbers assigned to the arcs at each node, are called d-graphs. A class of generalized automata, called cellular d-graph automata, in which the intercell connections define a d-graph, is introduced. It can be shown that a cellular d-graph automaton can measure various properties of its underlying graph; can detect graph or subgraph isomorphism; and can recognize various basic types of graphs. Most of these tasks can be performed in time proportional to the diameter of the given graph. Closure properties of d-graph languages are also briefly discussed.