Geben Sie Ihre E-Mail-Adresse oder Handynummer ein und Sie erhalten einen direkten Link, um die kostenlose Reader-App herunterzuladen.
Die Ex Libris-Reader-App ist für iOS und Android erhältlich. Weitere Informationen zu unseren Apps finden Sie hier.
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.
Klappentext
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.
Titel: | Hyperedge Replacement: Grammars and Languages |
Autor: | |
EAN: | 9783540560050 |
ISBN: | 354056005X |
Format: | Kartonierter Einband |
Herausgeber: | Springer Berlin Heidelberg |
Anzahl Seiten: | 232 |
Gewicht: | 359g |
Größe: | H235mm x B155mm x T12mm |
Jahr: | 1992 |
Untertitel: | Englisch |
Auflage: | 1992 |
Sie haben bereits bei einem früheren Besuch Artikel in Ihren Warenkorb gelegt. Ihr Warenkorb wurde nun mit diesen Artikeln ergänzt. |