Von dem Buch Hyperedge Replacement: Grammars and Languages Author haben wir 2 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: Habel, Annegret: Hyperedge Replacement: Grammars and Languages Author (ISBN: 9783540560050) in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
100%: Annegret Habel: Hyperedge Replacement: Grammars and Languages (ISBN: 9783540473404) Springer Nature, in Englisch, auch als eBook.Nur diese Ausgabe anzeigen…
Hyperedge Replacement: Grammars and Languages Author
9 Angebote vergleichen
| Preise | 2012 | 2013 | 2014 | 2015 | 2021 |
|---|---|---|---|---|---|
| Schnitt | € 44,97 | € 52,12 | € 66,20 | € 71,37 | € 68,90 |
| Nachfrage |
1
Symbolbild
Hyperedge Replacement: Grammars and Languages (1992)
DE PB NW RPISBN: 9783540560050 bzw. 354056005X, in Deutsch, Springer Dez 1992, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
This item is printed on demand - Print on Demand Titel. Neuware - The area of graph grammars is theoretically attractive and well motivated by various 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 may distinguish 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. 232 pp. Englisch.
This item is printed on demand - Print on Demand Titel. Neuware - The area of graph grammars is theoretically attractive and well motivated by various 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 may distinguish 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. 232 pp. Englisch.
2
Hyperedge Replacement: Grammars and Languages
DE PB NWISBN: 9783540560050 bzw. 354056005X, in Deutsch, Springer, Berlin, Taschenbuch, neu.
Lieferung aus: Deutschland, Versandkostenfrei.
buecher.de GmbH & Co. KG, [1].
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.xi, 221 S. XI, 221 p. 233 mmVersandfertig in 3-5 Tagen, Softcover.
buecher.de GmbH & Co. KG, [1].
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.xi, 221 S. XI, 221 p. 233 mmVersandfertig in 3-5 Tagen, Softcover.
3
Hyperedge Replacement: Grammars and Languages
~EN PB NWISBN: 9783540560050 bzw. 354056005X, vermutlich in Englisch, Springer Shop, Taschenbuch, neu.
Lieferung aus: Deutschland, En Stock, frais de port.
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. Soft cover.
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. Soft cover.
4
Hyperedge Replacement: Grammars and Languages
~EN NW EB DLISBN: 9783540473404 bzw. 3540473408, vermutlich in Englisch, Springer Shop, neu, E-Book, elektronischer Download.
Lieferung aus: Deutschland, En Stock, frais de port.
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. eBook.
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. eBook.
5
Hyperedge Replacement: Grammars and Languages Annegret Habel Author
~EN PB NWISBN: 9783540560050 bzw. 354056005X, vermutlich in Englisch, Springer Berlin Heidelberg, Taschenbuch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, En Stock, frais de port.
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.
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.
6
Symbolbild
Hyperedge Replacement: Grammars and Languages (2014)
DE PB NWISBN: 9783540560050 bzw. 354056005X, in Deutsch, SPRINGER VERLAG GMBH 01/08/2014, Taschenbuch, neu.
Von Händler/Antiquariat, Books2Anywhere [190245], Fairford, GLO, United Kingdom.
New Book. This item is printed on demand. Shipped from UK. This item is printed on demand.
New Book. This item is printed on demand. Shipped from UK. This item is printed on demand.
7
Symbolbild
Hyperedge Replacement: Grammars And Languages (1992)
DE PB NWISBN: 9783540560050 bzw. 354056005X, in Deutsch, Springer-Verlag Berlin And Heidelberg Gmbh & Co. Kg, Taschenbuch, neu.
Von Händler/Antiquariat, Revaluation Books [2134736], Exeter, DEV, United Kingdom.
1992 edition. 224 pages. 9.37x6.46x0.55 inches. In Stock.
1992 edition. 224 pages. 9.37x6.46x0.55 inches. In Stock.
8
Hyperedge Replacement: Grammars and Languages (Lecture Notes in Computer Science) (2008)
DE USISBN: 9783540560050 bzw. 354056005X, in Deutsch, Springer, gebraucht.
getbooks GmbH, [4040832].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
9
Hyperedge Replacement: Grammars and Languages
DE NW EBISBN: 9783540473404 bzw. 3540473408, in Deutsch, Springer Nature, neu, E-Book.
Lieferung aus: Vereinigte Staaten von Amerika, Lagernd.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…