메뉴 건너뛰기
Acta Informatica
Volumn 41, Issue 1, 2004, Pages 19-61
An axiomatization of graphs
Author keywords

[No Author keywords available]
Indexed keywords

AXIOMATIZATION; FINITE SET OF EQUATIONS; HYPERGRAPHS;
EID: 9944254213     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00236-004-0149-8     Document Type: Article
Times cited : (15)
References (16)
  • 1
    • 0018048377 scopus 로고
    • Théorie des magmoides. I
    • [AD1]
    • [AD1] Arnold, A., Dauchet, M. (1978) Théorie des magmoides. I. RAIRO Inform. Théor 12(3): 235-257
    • (1978) RAIRO Inform. Théor , vol.12 , Issue.3 , pp. 235-257
    • Arnold, A.1    Dauchet, M.2
  • 2
    • 9944256355 scopus 로고
    • Théorie des magmoides. II
    • [AD2]
    • [AD2] Arnold, A., Dauchet, M. (1979) Théorie des magmoides. II. RAIRO Inform. Théor 13(2): 135-154
    • (1979) RAIRO Inform. Théor , vol.13 , Issue.2 , pp. 135-154
    • Arnold, A.1    Dauchet, M.2
  • 3
    • 0003160921 scopus 로고
    • Graph expressions and graph rewritings
    • [BC]
    • [BC] Bauderon, M., Courcelle, B. (1987) Graph expressions and graph rewritings. Math. Syst. Theory 20: 83-127
    • (1987) Math. Syst. Theory , vol.20 , pp. 83-127
    • Bauderon, M.1    Courcelle, B.2
  • 4
    • 0039734822 scopus 로고
    • A Kleene theorem for a class of planar acyclic graphs
    • [BDW]
    • [BDW] Bossut, F., Dauchet, M., Warin, B. (1995) A Kleene theorem for a class of planar acyclic graphs. Inform, and Comput. 117: 251-265
    • (1995) Inform, and Comput. , vol.117 , pp. 251-265
    • Bossut, F.1    Dauchet, M.2    Warin, B.3
  • 5
    • 0037125847 scopus 로고    scopus 로고
    • Normal forms for algebras of connections
    • [BGM]
    • [BGM] Bruni, R., Gadducci, F., Montanari, U. (2002) Normal forms for algebras of connections. Theoret. Comp. Sci. 286: 247-292
    • (2002) Theoret. Comp. Sci. , vol.286 , pp. 247-292
    • Bruni, R.1    Gadducci, F.2    Montanari, U.3
  • 6
    • 0015193179 scopus 로고
    • Ein Vollständigkeitssatz für Programme und Schaltkreise
    • [Cla]
    • [Cla] Claus, V. (1971) Ein Vollständigkeitssatz für Programme und Schaltkreise. Acta Informatica 1: 64-78
    • (1971) Acta Informatica , vol.1 , pp. 64-78
    • Claus, V.1
  • 7
    • 0000262514 scopus 로고    scopus 로고
    • An algebraic presentation of term graphs, via gs-monoidal categories
    • [CG]
    • [CG] Corradini, A., Gadducci, F. (1999) An algebraic presentation of term graphs, via gs-monoidal categories. Appl. Categ. Structures 7(4): 299-331
    • (1999) Appl. Categ. Structures , vol.7 , Issue.4 , pp. 299-331
    • Corradini, A.1    Gadducci, F.2
  • 8
    • 0001015320 scopus 로고
    • Classes of finite relations as initial abstract data types I
    • [CS1]
    • [CS1] Cǎzǎnescu, V.E., Ştefǎnescu, Gh. (1991) Classes of finite relations as initial abstract data types I. Discrete Mathematics 90: 233-265
    • (1991) Discrete Mathematics , vol.90 , pp. 233-265
    • Cǎzǎnescu, V.E.1    Ştefǎnescu, Gh.2
  • 9
    • 0026882427 scopus 로고
    • A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
    • [CS2]
    • [CS2] Cǎzǎnescu, V.E., Ştefǎnescu, Gh. (1992) A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization. Theoret. Comput. Sci. 99: 1-63
    • (1992) Theoret. Comput. Sci. , vol.99 , pp. 1-63
    • Cǎzǎnescu, V.E.1    Ştefǎnescu, Gh.2
  • 10
    • 0039375896 scopus 로고    scopus 로고
    • Context-free graph grammars and concatenation of graphs
    • [EV]
    • [EV] Engelfriet, J., Vereijken, J.J. (1997) Context-free graph grammars and concatenation of graphs. Acta Informatica 34: 773-803
    • (1997) Acta Informatica , vol.34 , pp. 773-803
    • Engelfriet, J.1    Vereijken, J.J.2
  • 11
    • 84957891900 scopus 로고    scopus 로고
    • An inductive view of graph transformation
    • [GH]. Recent Trends in Algebraic Development Techniques (Tarquinia 1997), Springer, Berlin Heidelberg New York
    • [GH] Gadducci, F., Heckel, R. (1997) An inductive view of graph transformation. Recent Trends in Algebraic Development Techniques (Tarquinia 1997). Lecture Notes in Computer Science 1376, Springer, Berlin Heidelberg New York, pp. 223-237
    • (1997) Lecture Notes in Computer Science , vol.1376 , pp. 223-237
    • Gadducci, F.1    Heckel, R.2
  • 12
    • 84958776882 scopus 로고
    • An initial-algebra approach to directed acyclic graphs
    • [Gib]. Mathematics of program construction (Kloster Irsee, 1995). Springer, Berlin Heidelberg New York
    • [Gib] Gibbons, J. (1995) An initial-algebra approach to directed acyclic graphs. Mathematics of program construction (Kloster Irsee, 1995). Lecture Notes in Computer Science 947. Springer, Berlin Heidelberg New York, pp. 282-303
    • (1995) Lecture Notes in Computer Science , vol.947 , pp. 282-303
    • Gibbons, J.1
  • 13
    • 0000290331 scopus 로고
    • Eine Algebraisierung des Syntheseproblems von Schaltkreisen
    • [Hot1]
    • [Hot1] Hotz, G. (1965) Eine Algebraisierung des Syntheseproblems von Schaltkreisen. EIK 1:185-205, 209-231
    • (1965) EIK , vol.1 , pp. 185-205
    • Hotz, G.1
  • 14
    • 0040920691 scopus 로고
    • Eindeutigkeit und Mehrdeutigkeit formaler Sprachen
    • [Hot2]
    • [Hot2] Hotz, G. (1966) Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. EIK 2: 235-246
    • (1966) EIK , vol.2 , pp. 235-246
    • Hotz, G.1
  • 15
    • 0019551297 scopus 로고
    • Parallel and two-way automata on directed ordered acyclic graphs
    • [KS]
    • [KS] Kamimura, T., Slutzki, G. (1981) Parallel and two-way automata on directed ordered acyclic graphs. Inform, and Control 49: 10-51
    • (1981) Inform, and Control , vol.49 , pp. 10-51
    • Kamimura, T.1    Slutzki, G.2

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