TY  - BOOK
AU  - Habel,Annegret
ED  - SpringerLink (Online service)
TI  - Hyperedge Replacement: Grammars and Languages
T2  - Lecture Notes in Computer Science,
SN  - 9783540473404
AV  - QA8.9-QA10.3 
U1  - 005.131 23
PY  - 1992///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Combinatorics
KW  - Logic, Symbolic and mathematical
KW  - Computer Science
KW  - Mathematical Logic and Formal Languages
KW  - Mathematical Logic and Foundations
N1  - General Introduction -- to hyperedge-replacement grammars -- Basic properties of HRG's -- Characterizations of HRL's -- Structural aspects of HRL's -- Generative power of HRG's -- Graph-theoretic aspects of HRL's -- Boundedness aspects of HRL's -- Extensions and variations of HRG's -- Conclusion
N2  - The area of graph grammars is theoretically attractive and well motivated byvarious applications. More than 20 years ago, the concept of graph grammars was introduced by A. Rosenfeld as a formulation of some problems in pattern recognition and image processing, as well as by H.J. Schneider as a method for data type specification. Within graph-grammar theory one maydistinguish the set-theoretical approach, the algebraic approach, and the logical approach. These approaches differ in the method in which graph replacement is described. Specific approaches, node replacement and hyperedge replacement, concern the basic units of a hypergraph, nodes and hyperedges. This monograph is mainly concerned with the hyperedge-replacement approach. Hyperedge-replacement grammars are introduced as a device for generating hypergraph languages including graph languages and string languages. The concept combines a context-free rewriting with a comparatively large generative power. The volume includes a foreword by H. Ehrig
UR  - http://dx.doi.org/10.1007/BFb0013875
ER  -