| 書目名稱 | Hyperedge Replacement: Grammars and Languages | | 編輯 | Annegret Habel | | 視頻video | http://file.papertrans.cn/431/430625/430625.mp4 | | 叢書名稱 | Lecture Notes in Computer Science | | 圖書封面 |  | | 描述 | The area of graph grammars is theoretically attractive andwell motivated byvarious applications. More than 20 yearsago, the concept of graph grammars was introduced by A.Rosenfeld as a formulation of some problems in patternrecognition and image processing, as well as by H.J.Schneideras a method for data type specification. Withingraph-grammar theory one maydistinguish the set-theoreticalapproach, the algebraic approach, and the logical approach.These approaches differ in the method in whichgraphreplacement is described. Specific approaches,node replacement and hyperedge replacement, concern thebasic units of a hypergraph, nodes and hyperedges.This monograph is mainly concerned with thehyperedge-replacement approach. Hyperedge-replacementgrammars areintroduced as a device for generatinghypergraph languages including graphlanguages and stringlanguages. The concept combines a context-free rewritingwith a comparatively large generative power. Thevolumeincludes a foreword by H. Ehrig. | | 出版日期 | Book 1992 | | 關(guān)鍵詞 | Graph Algorithms; Graph Grammars; Graph Languages; Graph Transformations; Graphen-Algorithmen; Graphen-Gr | | 版次 | 1 | | doi | https://doi.org/10.1007/BFb0013875 | | isbn_softcover | 978-3-540-56005-0 | | isbn_ebook | 978-3-540-47340-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 1992 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-15 02:05
發(fā)表于 2025-3-21 18:17:17
