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 条

[1] A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars
F. Drewes
Theory of Computing Systems, 1999, 32 : 159 - 208
[2] A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
Drewes, F
THEORY OF COMPUTING SYSTEMS, 1999, 32 (02) : 159 - 208
[3] DECIDABLE BOUNDEDNESS PROBLEMS FOR HYPEREDGE-REPLACEMENT GRAPH-GRAMMARS
HABEL, A
KREOWSKI, HJ
VOGLER, W
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 351 : 275 - 289
[4] DECIDABLE BOUNDEDNESS PROBLEMS FOR SETS OF GRAPHS GENERATED BY HYPEREDGE-REPLACEMENT
HABEL, A
KREOWSKI, HJ
VOGLER, W
THEORETICAL COMPUTER SCIENCE, 1991, 89 (01) : 33 - 62
[5] On hyperedge replacement and BNLC graph grammars
1600, (46):
[6] Synchronous Hyperedge Replacement Graph Grammars
Pennycuff, Corey
Sikdar, Satyaki
Vajiac, Catalina
Chiang, David
Weninger, Tim
GRAPH TRANSFORMATION (ICGT 2018), 2018, 10887 : 20 - 36
[7] A LOGICAL CHARACTERIZATION OF THE SETS OF HYPERGRAPHS DEFINED BY HYPEREDGE REPLACEMENT GRAMMARS
COURCELLE, B
ENGELFRIET, J
MATHEMATICAL SYSTEMS THEORY, 1995, 28 (06): : 515 - 552
[8] ON HYPEREDGE REPLACEMENT AND BNLC GRAPH-GRAMMARS
VOGLER, W
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 411 : 78 - 93
[9] ON HYPEREDGE REPLACEMENT AND BNLC GRAPH-GRAMMARS
VOGLER, W
DISCRETE APPLIED MATHEMATICS, 1993, 46 (03) : 253 - 273
[10] Learning Hyperedge Replacement Grammars for Graph Generation
Aguinaga, Salvador
Chiang, David
Weninger, Tim
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2019, 41 (03) : 625 - 638

← 1 2 3 4 5 →