Graph-Grammars and Their Application to Computer Science 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986 / edited by Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, Azriel Rosenfeld.
The generic term "graph-grammars" refers to a variety of methods for specifying (possibly infinite) sets of graphs or sets of maps. The area of graph-grammars originated in the late 60s motivated by considerations concerning pattern recognition - since then the list of areas which have int...
Full description
Saved in:
Bibliographic Details
| Corporate Author: |
SpringerLink (Online service) |
|---|
| Other Authors: |
Ehrig, Hartmut
(Editor),
Nagl, Manfred
(Editor),
Rozenberg, Grzegorz
(Editor),
Rosenfeld, Azriel
(Editor) |
|---|
| Format: | eBook
|
|---|
| Language: | English |
|---|
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
1987.
|
|---|
| Edition: | 1st ed. 1987. |
|---|
| Series: | Lecture Notes in Computer Science,
291
Springer eBook Collection.
|
|---|
| Subjects: | |
|---|
| Online Access: | Click to view e-book
|
|---|
| Holy Cross Note: | Loaded electronically.
Electronic access restricted to members of the Holy Cross Community. |
|---|