03673nam 22005055 450 99646633700331620240201182055.03-540-39897-X10.1007/BFb0000094(CKB)1000000000230270(SSID)ssj0000323606(PQKBManifestationID)11242998(PQKBTitleCode)TC0000323606(PQKBWorkID)10301068(PQKB)11499169(DE-He213)978-3-540-39897-4(PPN)155187295(EXLCZ)99100000000023027020121227d1983 u| 0engurnn#008mamaatxtccrGraph-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. Rozenberg1st ed. 1983.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1983.Lecture Notes in Computer Science,0302-9743 ;153Bibliographic Level Mode of Issuance: Monograph3-540-12310-5 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).Lecture Notes in Computer Science,0302-9743 ;153Under the auspices of the European Association for Theoretical Computer ScienceAlgorithmsAlgorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Algorithms.Algorithm Analysis and Problem Complexity.005.1Ehrig Hartmutedthttp://id.loc.gov/vocabulary/relators/edtNagl Medthttp://id.loc.gov/vocabulary/relators/edtRozenberg Gedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466337003316Graph-grammars and their application to computer science878436UNISA