Graph Grammars and Their Application to Computer Science
4th International Workshop, Bremen, Germany, March 5-9, 1990. Proceedings (Lecture Notes in Computer Science)
Our rough guess is there are 175,750 words in this book.
At a pace averaging 250 words per minute, this book will take 11 hours and 43 minutes to read. With a half hour per day, this will take 24 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Contributions
- Hartmut Ehrig (Editor) - Contributor
- Hans-Jvrg Kreowski (Editor) - Contributor
- Grzegorz Rozenberg (Editor) - Contributor
Publication
1991-10-01 - Springer
Language
English
Word Count
175,750 words, Guess
Page Count
703 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL9060687M
- ISBN-10354054478X
- ISBN-139783540544784
- Goodreads4801494
First Sentence
Hyperedge replacement is one of the most elementary and frequently used concepts of graph transformation with the characteristics of context-free rewriting.
Subjects
Other Editions
- Graph Grammars and Their Application to Computer Science: 4th International Workshop, Bremen, Germany, March 5-9, 1990. Proceedings (Lecture Notes in Computer Science)
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!