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.

Bibliographic Information

Book Title: Hyperedge Replacement: Grammars and Languages
Authors: Annegret Habel
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/BFb0013875
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1992
Softcover ISBN: 978-3-540-56005-0Published: 17 December 1992
eBook ISBN: 978-3-540-47340-4Published: 23 November 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 221
Topics: Theory of Computation, Programming Languages, Compilers, Interpreters, Mathematical Logic and Formal Languages, Combinatorics, Mathematical Logic and Foundations

Publish with us

Policies and ethics

Hyperedge Replacement: Grammars and Languages

Overview

Access this book

Other ways to access

Table of contents (10 chapters)

Front Matter

Back Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation