Similar to our basic (non-extended) model, graph acceptors of this type recognize graph languages of bounded degree.
because of the overlapping of tiles in runs and the occurrence constraint, they are considerably more powerful than our DAG automata (and thus too powerful for our purposes) unless the tiles are required to have the radius 0 (i.e., they are single nodes).