Graph Grammars and Their Application to Computer Science
Subtitle: 5th International Workshop, Williamsburg, VA, USA, November (13-18), 1995. Selected Papers. (Lecture Notes in Computer Science)
Contributors: Janice Cuny (Editor); Hartmut Ehrig (Editor); Gregor Engels (Editor); Grzegorz Rozenberg (Editor)
Edition: 1 edition
Publisher: Springer
Published: May 8, 1996
Language: eng
Format: Paperback
Number of pages: 565
ISBN-13: 9783540612285
Subjects: Combinatorics & graph theory; Mathematical theory of computation; Mathematics for scientists & engineers; Graph grammars; Computer Mathematics; Mathematics; Science/Mathematics; Graphic Methods; Logic; Concurrent Systems; Ersetzungstechniken; Graph Transformations; Graph algorithms; Graphalgorithmen; Graphgrammatiken; Graphtransformationen; Mathematics / Logic; Computer Science; Congresses
First sentence: During the last years, a good deal of work on the algebraic approach to graph transformation, both in the single and double pushout cases, has been based on the understanding of graphs as many-sorted unary total algebras, and it has even been generalized to such algebras.