Lecture Notes in Computer Science

Graph-Grammars and Their Application to Computer Science

3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986

Editors: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (Eds.)

Free Preview

Buy this book

eBook $119.00
price for USA in USD (gross)
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-48178-2
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $159.00
price for USA in USD
  • ISBN 978-3-540-18771-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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 interacted with the development of graph-grammars has grown quite impressively. It includes pattern recognition, software specification and development, VLSI layout schemes, data bases, lambda-calculus, analysis of concurrent systems, massively parallel computer architectures, incremental compilers, computer animation, complexity theory, developmental biology, music composition, representation of physical solids, and many others. This volume is based on the contributions presented at the third international workshop on graph-grammars and their applications, held in Warrenton, Virginia, USA in December 1986. Aiming at the best possible representation of the field not all of the papers presented at the meeting appear in this volume and some of the papers from this volume were not presented at the workshop. The volume consists of two parts: Part I presents tutorial introductions to a number of basic graph and map rewriting mechanisms. Part II contains technical contributions. This collection of papers provides the reader with an up-to-date overview of current trends in graph-grammars.

Table of contents (39 chapters)

Table of contents (39 chapters)
  • Tutorial introduction to the algebraic approach of graph grammars

    Ehrig, Hartmut

    Pages 1-14

  • May we introduce to you: Hyperedge replacement

    Habel, Annegret (et al.)

    Pages 15-26

  • An introduction to parallel map generating systems

    Lindenmayer, Aristid

    Pages 27-40

  • Set theoretic approaches to graph grammars

    Nagl, Manfred

    Pages 41-54

  • An introduction to the NLC way of rewriting graphs

    Rozenberg, G.

    Pages 55-66

Buy this book

eBook $119.00
price for USA in USD (gross)
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-48178-2
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $159.00
price for USA in USD
  • ISBN 978-3-540-18771-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Graph-Grammars and Their Application to Computer Science
Book Subtitle
3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
Editors
  • Hartmut Ehrig
  • Manfred Nagl
  • Grzegorz Rozenberg
  • Azriel Rosenfeld
Series Title
Lecture Notes in Computer Science
Series Volume
291
Copyright
1987
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-48178-2
DOI
10.1007/3-540-18771-5
Softcover ISBN
978-3-540-18771-4
Series ISSN
0302-9743
Edition Number
1
Number of Pages
X, 622
Topics