Toward a mathematical theory of graph-generative systems and its applications

Abstract This paper presents some formal generative specifications for describing the graph languages consisting of the sets of directed graphs with labeled arcs. Some mathematical results are introduced. In addition, we consider applications to specification technique for data structures and complexity measure of computer software. Finally, directions for future research are indicated.

[1]  Malcolm Bird,et al.  The Equivalence Problem for Deterministic Two-Tape Automata , 1973, J. Comput. Syst. Sci..

[2]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

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

[4]  Stephen N. Zilles,et al.  Specification techniques for data abstractions , 1975 .

[5]  Theodosios Pavlidis,et al.  Linear and Context-Free Graph Grammars , 1972, JACM.

[6]  Stephen J. Garland,et al.  Program Schemes, Recursion Schemes, and Formal Languages , 1973, J. Comput. Syst. Sci..

[7]  Edsger W. Dijkstra,et al.  Letters to the editor: go to statement considered harmful , 1968, CACM.

[8]  Alan C. Shaw,et al.  PICTURE GRAPHS, GRAMMARS, AND PARSING**This work was supported in part by The National Science Foundation grant GJ-108. , 1972 .

[9]  Gerald M. Weinberg,et al.  Psychology of computer programming , 1971 .

[10]  V. E. Itkin,et al.  On Program Schemata Equivalence , 1972, J. Comput. Syst. Sci..

[11]  Dennis Tsichritzis,et al.  The Equivalence Problem of Simple Programs , 1970, JACM.

[12]  Terrence W. Pratt,et al.  Pair Grammars, Graph Languages and String-to-Graph Translations , 1971, J. Comput. Syst. Sci..

[13]  Jay Earley,et al.  Toward an understanding of data structures , 1971, SIGFIDET '70.

[14]  William C. Hetzel,et al.  Program test methods , 1973 .

[15]  Stephen A. Cook.  A Hierarchy for Nondeterministic Time Complexity , 1973, J. Comput. Syst. Sci..

[16]  Forbes D. Lewis,et al.  The Enumerability and Invariance of Complexity Classes , 1971, J. Comput. Syst. Sci..

[17]  Azriel Rosenfeld,et al.  Web Grammars , 1969, IJCAI.

[18]  Herbert B. Enderton.  Degrees of Computational Complexity , 1972, J. Comput. Syst. Sci..

[19]  King-Sun Fu,et al.  Syntactic Methods in Pattern Recognition , 1974, IEEE Transactions on Systems, Man, and Cybernetics.

[20]  Pei Hsia,et al.  Graph Walking Automata , 1975, MFCS.

[21]  Jerome Feder,et al.  Plex languages , 1971, Inf. Sci..

[22]  Claus-Peter Schnorr,et al.  Process complexity and effective random tests , 1973 .