A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars

被引：0
|
作者：
Department of Computer Science, University of Bremen, P.O. Box 33 04 40, D-28334 Bremen, Germany [1 ]
机构：
来源：
Theory Comput. Syst. | / 2卷 / 159-208期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Transducers
引用
收藏
相关论文
共 50 条
  • [41] USING GRAPH GRAMMARS TO DEFINE SETS OF DIGRAPHS.
    Furtado, A.L.
    Mylopoulos, J.
    INFOR Journal, 1979, 17 (03): : 242 - 261
  • [42] Node replacement graph grammars with dynamic node relabeling
    Kim, Changwook
    Ando, Mahiro
    THEORETICAL COMPUTER SCIENCE, 2015, 583 : 40 - 50
  • [43] Towards Interpretable Graph Modeling with Vertex Replacement Grammars
    Hibshman, Justus
    Sikdar, Satyaki
    Weninger, Tim
    2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2019, : 770 - 779
  • [44] Tree languages generated by context-free graph grammars
    Engelfriet, J
    Maneth, S
    THEORY AND APPLICATION TO GRAPH TRANSFORMATIONS, 2000, 1764 : 15 - 29
  • [45] CONTEXT-FREE GRAPH LANGUAGES OF BOUNDED DEGREE ARE GENERATED BY APEX GRAPH-GRAMMARS
    ENGELFRIET, J
    HEYKER, L
    LEIH, G
    ACTA INFORMATICA, 1994, 31 (04) : 341 - 378
  • [46] CHARACTERISTICS OF GRAPH LANGUAGES GENERATED BY EDGE REPLACEMENT
    HABEL, A
    KREOWSKI, HJ
    THEORETICAL COMPUTER SCIENCE, 1987, 51 (1-2) : 81 - 115
  • [47] FROM GRAPH-GRAMMARS TO HIGH-LEVEL REPLACEMENT SYSTEMS
    EHRIG, H
    HABEL, A
    KREOWSKI, HJ
    PARISIPRESICCE, F
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 532 : 269 - 291
  • [48] CHARACTERISTICS OF GRAPH LANGUAGES GENERATED BY EDGE REPLACEMENT.
    Habel, Annegret
    Kreowski, Hans-Joerg
    1600, (51): : 1 - 2
  • [49] ON CONTEXT-FREE GRAPH LANGUAGES GENERATED BY EDGE REPLACEMENT
    HABEL, A
    KREOWSKI, HJ
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 153 : 143 - 158
  • [50] A Characterization for Intuitionistic Fuzzy Sets Based on the Assistant Sets Generated by S-Rough Sets
    Lin, Meng-Lei
    FUZZY INFORMATION AND ENGINEERING, VOL 1, 2009, 54 : 627 - 631
12345