LEADER 03673nam  22005055  450 
001 996466337003316
005 20240201182055.0
010   $a3-540-39897-X
024 7 $a10.1007/BFb0000094
035   $a(CKB)1000000000230270
035   $a(SSID)ssj0000323606
035   $a(PQKBManifestationID)11242998
035   $a(PQKBTitleCode)TC0000323606
035   $a(PQKBWorkID)10301068
035   $a(PQKB)11499169
035   $a(DE-He213)978-3-540-39897-4
035   $a(PPN)155187295
035   $a(EXLCZ)991000000000230270
100   $a20121227d1983      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aGraph-Grammars and Their Application to Computer Science$b[electronic resource] $e2nd International Workshop. Haus Ohrbeck, Germany, October 4 - 8, 1982 /$fedited by H. Ehrig, M. Nagl, G. Rozenberg
205   $a1st ed. 1983.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1983.
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v153
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-12310-5 
327   $aGrammatical 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).
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v153
517 3 $aUnder the auspices of the European Association for Theoretical Computer Science
606   $aAlgorithms
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
615  0$aAlgorithms.
615 14$aAlgorithm Analysis and Problem Complexity.
676   $a005.1
702   $aEhrig$b Hartmut$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aNagl$b M$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRozenberg$b G$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466337003316
996   $aGraph-grammars and their application to computer science$9878436
997   $aUNISA