Sequential and cellular graph automata

Labeled graphs of bounded degree, with numbers assigned to the arcs at each node, are called d-graphs. Sequential and cellular d-graph automata are defined, and it is shown that they can simulate each other and are also equivalent to web-bounded automata.

[1]  Azriel Rosenfeld,et al.  Cellular Graph Automata , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[2]  David L. Milgram,et al.  Web Automata , 1975, Inf. Control..

[3]  Stephen N. Cole.  Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Trans. Computers.

[4]  Azriel Rosenfeld,et al.  Networks of Automata: Some Applications , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Azriel Rosenfeld,et al.  Cellular Graph Automata. II. Graph and Subgraph Isomorphism, Graph Structure Recognition , 1979, Inf. Control..

[6]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[7]  Azriel Rosenfeld,et al.  Array Automata and Array Grammars , 1971, IFIP Congress.

[8]  M. Blum,et al.  Automata on a 2-Dimensional Tape , 1967, SWAT.

[9]  Arthur W. Burks,et al.  Essays on cellular automata , 1970 .

[10]  Frank Harary,et al.  Graph Theory , 2016 .

[11]  P. Rosenstiehl,et al.  INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS , 1972 .

[12]  John Mylopoulos.  On the Relation of Graph Grammars and Graph Automata , 1972, SWAT.