Vai al contenuto principale della pagina
Titolo: | Graph-Grammars and Their Application to Computer Science [[electronic resource] ] : 2nd International Workshop. Haus Ohrbeck, Germany, October 4 - 8, 1982 / / edited by H. Ehrig, M. Nagl, G. Rozenberg |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983 |
Edizione: | 1st ed. 1983. |
Disciplina: | 005.1 |
Soggetto topico: | Algorithms |
Algorithm Analysis and Problem Complexity | |
Persona (resp. second.): | EhrigHartmut |
NaglM | |
RozenbergG | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di contenuto: | Grammatical inference of graph grammars for syntactic pattern recognition -- Graph grammars as a generative tool in image understanding -- Graph grammars for distributed systems -- Algorithms for the generation and drawing of maps representing cell clones -- Aspects of concurrency in graph grammars -- Church-Rosser properties for graph replacement systems with unique splitting -- Specification of data bases through rewriting rules -- Petri nets and their relation to graph grammars -- Attributed graph grammars for graphics -- On context-free graph languages generated by edge replacement -- Modelling compiler generation by graph grammars -- Hypergraph systems generating graph languages -- Graph grammars with node-label controlled rewriting and embedding -- Parsing of graphs in linear time -- Generation of 3-dimensional plant bodies by double wall map and stereomap systems -- Chain code picture languages -- A graph-relational approach to geographic databases -- Graph transductions in the field of automatic translation of natural languages -- Software specification by graph grammars -- Geometry versus topology in Map grammars -- Transformation of structures by convex homomorphisms -- Formal specification of software using H-graph semantics -- Cellular computers for parallel region-level image processing -- Tree-graph grammars for pattern recognition -- The isomorphism problem is polynomially solvable for certain graph languages -- Space-filling curves and infinite graphs -- Two-level expression representation for faster evaluation -- Characterization of graph classes by forbidden structures and reductions -- On graph rewriting systems (Graph-Grammars). |
Altri titoli varianti: | Under the auspices of the European Association for Theoretical Computer Science |
Titolo autorizzato: | Graph-grammars and their application to computer science |
ISBN: | 3-540-39897-X |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996466337003316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |