Graph Transformations in Computer Science
Editat de Hans J. Schneider, Hartmut Ehrigen Limba Engleză Paperback – 28 mar 1994
Preț: 327.92 lei
Preț vechi: 409.89 lei
-20%
Puncte Express: 492
Preț estimativ în valută:
57.99€ • 66.49$ • 50.12£
57.99€ • 66.49$ • 50.12£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540577874
ISBN-10: 3540577874
Pagini: 412
Ilustrații: VIII, 404 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540577874
Pagini: 412
Ilustrații: VIII, 404 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Path-controlled graph grammars for multiresolution image processing and analysis.- Syntax and semantics of hybrid database languages.- Decomposability helps for deciding logics of knowledge and belief.- Extending graph rewriting with copying.- Graph-grammar semantics of a higher-order programming language for distributed systems.- Abstract graph derivations in the double pushout approach.- Note on standard representation of graphs and graph derivations.- Jungle rewriting: An abstract description of a lazy narrowing machine.- Recognizable sets of graphs of bounded tree-width.- Canonical derivations for high-level replacement systems.- A computational model for generic graph functions.- Graphs and designing.- ESM systems and the composition of their computations.- Relational structures and their partial morphisms in view of single pushout rewriting.- Single pushout transformations of equationally defined graph structures with applications to actor systems.- Parallelism in single-pushout graph rewriting.- Semantics of full statecharts based on graph rewriting.- Contextual occurrence nets and concurrent constraint programming.- Uniform-modelling in graph grammar specifications.- Set-theoretic graph rewriting.- On relating rewriting systems and graph grammars to event structures.- Logic based structure rewriting systems.- Guaranteeing safe destructive updates through a type system with uniqueness information for graphs.- Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system.