메뉴 건너뛰기




Volumn 154, Issue 2, 1996, Pages 329-348

Confluence for graph transformations

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; GRAPH THEORY; PROBLEM SOLVING; THEOREM PROVING;

EID: 0347874669     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00007-0     Document Type: Article
Times cited : (2)

References (11)
  • 1
    • 0003160921 scopus 로고
    • Graph expressions and graph rewritings
    • M. Bauderon and B. Courcelle, Graph expressions and graph rewritings, Math. Systems Theory 20 (1987) 83-127.
    • (1987) Math. Systems Theory , vol.20 , pp. 83-127
    • Bauderon, M.1    Courcelle, B.2
  • 2
    • 0002894613 scopus 로고
    • Introduction to the algebraic theory of graphs
    • Springer, Berlin
    • H. Erigh, Introduction to the algebraic theory of graphs, Lecture Notes in Computer Science, Vol. 73 (Springer, Berlin, 1979) 1-69.
    • (1979) Lecture Notes in Computer Science , vol.73 , pp. 1-69
    • Erigh, H.1
  • 4
    • 84976811006 scopus 로고
    • Confluent reductions: Abstract properties and applications to term rewriting systems
    • G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems, J. Assoc. Comput. Mach 27 (1980) 797-821.
    • (1980) J. Assoc. Comput. Mach , vol.27 , pp. 797-821
    • Huet, G.1
  • 5
    • 85015764580 scopus 로고
    • Termination of a set of rules modulo a set of equations
    • Shostak, ed., Proc. 7th Internat. Conf. on Automated Deduction Springer, Berlin
    • J.P. Jouannaud, and M. Munoz, Termination of a set of rules modulo a set of equations, in: Shostak, ed., Lectures Notes in Computer Science, Vol. 170, Proc. 7th Internat. Conf. on Automated Deduction (Springer, Berlin, 1984) 175-193.
    • (1984) Lectures Notes in Computer Science , vol.170 , pp. 175-193
    • Jouannaud, J.P.1    Munoz, M.2
  • 7
    • 0002896422 scopus 로고
    • Simple word problems in universal algebras
    • J. Leech, ed., Pergamon Press, Oxford
    • D.E. Knuth and P. Bendix, Simple word problems in universal algebras, in: J. Leech, ed., Computational Problems in Abstract Algebras (Pergamon Press, Oxford, 1970) 263-297.
    • (1970) Computational Problems in Abstract Algebras , pp. 263-297
    • Knuth, D.E.1    Bendix, P.2
  • 8
    • 37149029524 scopus 로고
    • Graph rewriting systems and their application to network reliability analysis
    • Springer, Berlin
    • Y. Okada and M. Hayashi, Graph rewriting systems and their application to network reliability analysis, Lecture Notes in Computer Science, Vol. 570 (Springer, Berlin, 1991) 36-47.
    • (1991) Lecture Notes in Computer Science , vol.570 , pp. 36-47
    • Okada, Y.1    Hayashi, M.2
  • 9
    • 84976823860 scopus 로고
    • Complete sets of reductions for some equational theories
    • G.E. Peterson and M.E. Stickel, Complete sets of reductions for some equational theories, Assoc. Comput. Mach. 28 (1981) 233-264.
    • (1981) Assoc. Comput. Mach. , vol.28 , pp. 233-264
    • Peterson, G.E.1    Stickel, M.E.2
  • 11
    • 0016589793 scopus 로고
    • Deriving graphs from graphs by applying a production
    • B.K. Rosen, Deriving graphs from graphs by applying a production, Acta Inform. 4 (1975) 337-357.
    • (1975) Acta Inform. , vol.4 , pp. 337-357
    • Rosen, B.K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.