Hyperedge replacement : grammars and languages

The Resource Hyperedge replacement : grammars and languages
Label
Hyperedge replacement : grammars and languages
Title remainder
grammars and languages
Statement of responsibility
A. Habel
Creator
Subject
Genre
Language
eng
Summary
"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."--PUBLISHER'S WEBSITE
Member of
Cataloging source
DLC
Illustrations
illustrations
Index
index present
LC call number
QA76
LC item number
.H22 1992
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography

Context

Context of Hyperedge replacement : grammars and languages

Work of

Zepheira Logo
Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by Boston University Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...