H ehrig (24 Ergebnisse)

Softcover. Zustand: Good. 1st Edition. 477 p; many Ill. [LECTURE NOTES IN COMPUTER SCIENCE ; 73]. Buch.

Zustand: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Tb. Sehr gut erhalten.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - to the algebraic theory of graph grammars (a survey).- A tutorial and bibliographical survey on graph grammars.- Partially-additive monoids, graph-growing, and the algebraic semantics of recursive calls.- Rewriting systems as a tool for relational data base design.- Programmed graph grammars.- Shortest path problems and tree grammars: An algebraic framework.- Constructing specifications of abstract data types by replacements.- Decomposition of graph grammar productions and derivations.- Locally star gluing formulas for a class of parallel graph grammars.- Transformations of data base structures.- Explicit versus implicit parallel rewriting on graphs.- Two-level graph grammars.- A pumping lemma for context-free graph languages.- Two-dimensional, differential, intercalary plant tissue growth and parallel graph generating and graph recurrence systems.- Parallel generation of maps: Developmental systems for cell layers.- Processes in structures.- Map grammars: Cycles and the algebraic approach.- On multilevel - Graph grammars.- Graph grammars and operational semantics.- Complexity of pattern generation by map-L systems.- A graph grammar that describes the set of two-dimensional surface networks.- Definition of programming language semantics using grammars for hierarchical graphs.- Determinism in relational systems.- Analysis of programs by reduction of their structure.- Graphs of processors.- Definitional mechanisms for conceptual graphs.- A graph-like lambda calculus for which leftmost-outermost reduction is optimal.- Relationships between graph grammars and the design and analysis of concurrent software.- Cellular graph automata.- List of participants.…

Teubner, ., 1974, , 239, TB, 8°, ohne Schutzumschlag, Englisch, Eintragungen: StaV, Einband: leicht bestoßen, minimal fleckig, Seiten: leicht gebräunt.

Zustand: New.

Zustand: Used. pp. xiv + 388.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Hardcover. Zustand: Brand New. hardback/cd-rom edition. 698 pages. 9.25x6.50x1.75 inches. In Stock.

Zustand: New. This handbook considers applications of graph grammars and computing by graph transformations to functional languages, visual and object-oriented languages, software engineering, mechanical engineering, chemical process engineering and images.Inhalt.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Buch. Zustand: Neu. Neuware - Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph transformations generalizes formal language theory based on strings and the theory of term rewriting based on trees. As a matter of fact, within the area of graph grammars, graph transformation is considered as a fundamental computation paradigm where computation includes specification, programming, and implementation. Over the last three decades, graph grammars have developed at a steady pace into a theoretically attractive and important-for-applications research field.Volume 2 of the indispensable Handbook of Graph Grammars and Computing by Graph Transformations considers applications to functional languages, visual and object-oriented languages, software engineering, mechanical engineering, chemical process engineering, and images. It also presents implemented specification languages and tools, and structuring and modularization concepts for specification languages. The contributions have been written in a tutorial/survey style by the top experts in the corresponding areas. This volume is accompanied by a CD-Rom containing implementations of specification environments based on graph transformation systems, and tools whose implementation is based on the use of graph transformation systems.…

paperback, Broschiert. Zustand: Sehr gut. Auflage: 1. Sehr gut erhalten. Ungelesen. No shipping to other EU countries due to the EU Packaging and Packaging Waste Regulation (PPWR), which entered into force on August 12, 2026. Sprache: Deutsch Gewicht in Gramm: 823.

Zustand: New. 1974. Paperback. . . . . .

Zustand: New. 1974. Paperback. . . . . . Books ship from the US and Ireland.

Zustand: New.

Paperback. Zustand: new. Paperback. Our purpose in writing this book is to present a universal theory of automata which on one hand unifies the theories of several well-known types of automata and on the other hand allows interesting new applications and results. The frame- work for our development is category theory, especially universal constructions in monoidal categories. But we will carefully motivate and introduce all those (and only those) notions and results of category theory which are needed in our approach. The reader is only assumed to be familiar with sets, deterministic functions, relations and the basic no- tions of structural mathematics. However, some knowledge of discrete probability distributions, linear algebra and general topology would be useful in understanding the corre- sponding applications and in having a better background for the general theory. All our constructions and results are motivated and interpreted carefully with respect to the classical theory of deterministic, partial, linear, topolog- ical, nondeterministic, relational and stochastic automata. The book is mainly devoted to students of theoretical com- puter science or mathematics and can be used as a textbook in graduate courses or seminars. On the other hand it will also be useful for many other people, who are concerned with the interesting new research area of category theory applied to computation and control. A Categorical Approach. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

2 vols. Original hardcovers. xviii,1036,(4) pp. & xviii,1037-1812,(4)pp., ill.; 24.5x18 cm. Text in English - (small signs of use) Very good. See picture 3380g.