Hyperedge Replacement: Grammars and Languages (Lecture Notes in Computer Science, 643)
4.0 (40 items)
Limited Time SaleUS$28.44 cheaper than the new price!!
Free cash-on-delivery fees for purchases over $99
Product details
| Management number | 232087612 | Release Date | 2026/06/18 | List Price | US$18.96 | Model Number | 232087612 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
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. Read more
| ISBN10 | 354056005X |
|---|---|
| ISBN13 | 978-3540560050 |
| Edition | 1992nd |
| Language | English |
| Publisher | Springer |
| Dimensions | 6.1 x 0.53 x 9.25 inches |
| Item Weight | 11.9 ounces |
| Print length | 232 pages |
| Publication date | December 17, 1992 |
Bestseller ranking
Electric Fuel Pumps
Customers who viewed this product also viewed
Combinatorics
Correction of product information
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form