ON GRAPH REWRITINGS

[1] BARENDREGT H, 1981, STUDIES LOGIC F MATH, V103

[2] Cocke John, 1970, PROGRAMMING LANGUAGE

[3] Ehrig H., 1973, 14th Annual Symposium on Switching Automata Theory, P167, DOI 10.1109/SWAT.1973.11

[4] CONFLUENT REDUCTIONS - ABSTRACT PROPERTIES AND APPLICATIONS TO TERM REWRITING SYSTEMS [J]. JOURNAL OF THE ACM, 1980, 27 (04) : 797 - 821

[5] Knuth D.E., 1970, COMPUTATIONAL PROBLE

[6] LEVY JJ, 1978, THESIS U PARIS 7

[7] MONTANGERO C, 1974, LECTURE NOTES COMPUT, V14

[1] BARENDREGT H, 1981, STUDIES LOGIC F MATH, V103

[2] Cocke John, 1970, PROGRAMMING LANGUAGE

[3] Ehrig H., 1973, 14th Annual Symposium on Switching Automata Theory, P167, DOI 10.1109/SWAT.1973.11

[4] CONFLUENT REDUCTIONS - ABSTRACT PROPERTIES AND APPLICATIONS TO TERM REWRITING SYSTEMS [J]. JOURNAL OF THE ACM, 1980, 27 (04) : 797 - 821

[5] Knuth D.E., 1970, COMPUTATIONAL PROBLE

[6] LEVY JJ, 1978, THESIS U PARIS 7

[7] MONTANGERO C, 1974, LECTURE NOTES COMPUT, V14