{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:01:56Z","timestamp":1761807716527},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187714"},{"type":"electronic","value":"9783540481782"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18771-5_62","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:47:56Z","timestamp":1330199276000},"page":"326-342","source":"Crossref","is-referenced-by-count":16,"title":["Practical applications of precedence graph grammars"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Kaul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(86)90070-3","volume":"13","author":"I.J. Aalbersberg","year":"1986","unstructured":"Aalbersberg, I.J.\/G. Rozenberg\/A. Ehrenfeucht: On the membership problem for regular DNLC grammars; Discr. Appl. Math. 13, (1986) 79\u201385","journal-title":"Discr. Appl. Math."},{"key":"23_CR2","volume-title":"The Theory of Parsing, Translation, and Compiling; I,II","author":"A.V. Aho","year":"1972","unstructured":"A.V. Aho\/J.D. Ullman: The Theory of Parsing, Translation, and Compiling; I,II, Prentice-Hall, Englewood Cliffs, NJ (1972)"},{"key":"23_CR3","first-page":"117","volume":"5","author":"J.P. Babinov","year":"1979","unstructured":"J.P. Babinov: Class of generalized context-sensitive prcedence languages; Progr.Comput. Software 5 (1979) 117\u2013126","journal-title":"Progr.Comput. Software"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H. Bunke","year":"1983","unstructured":"H. Bunke\/G. Allermann: Inexact Graph Matching for Structural Pattern Recognition; Pat.Rec.Let. 1 (1983) 245\u2013253","journal-title":"Pat.Rec.Let."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"V. Claus\/H. Ehrig\/G. Rozenberg: Graph-Grammars and Their Application to Computer Science and Biology; 1st Int. Workshop, LNCS 73, Springer (1979)","DOI":"10.1007\/BFb0025713"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"H. Ehrig\/M. Nagl\/G. Rozenberg(Eds.): Graph-Grammars and Their Application to Computer Science, 2nd Int. Workshop, LNCS 153, Springer (1983)","DOI":"10.1007\/BFb0000094"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00289155","volume":"10","author":"R. Franck","year":"1978","unstructured":"R. Franck: A Class of Linearly Parsable Graph Grammars, Acta Inform. 10(1978)175\u2013201","journal-title":"Acta Inform."},{"key":"23_CR8","volume-title":"Syntactic Pattern Recognition","author":"K.S. Fu","year":"1982","unstructured":"K.S. Fu: Syntactic Pattern Recognition; Prentice-Hall, Englewood Cliffs, NJ (1982)"},{"key":"23_CR9","volume-title":"A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey\/D.S. Johnson: Computers and Intractability; A Guide to the Theory of NP-Completeness; Freeman, San Francisco(1979)"},{"key":"23_CR10","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary: Graph Theory; Addison-Wesley Publ. Comp., Reading Mass. (1969)"},{"key":"23_CR11","volume-title":"Introduction to Formal Language Theory","author":"M. Harrison","year":"1978","unstructured":"M. Harrison: Introduction to Formal Language Theory; Addison-Wesley Publ. Comp., Reading Mass. (1978)"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1093\/comjnl\/17.3.234","volume":"17","author":"R. Haskell","year":"1974","unstructured":"R. Haskell: Symmetrical precedence relations on general phrase structure grammars; Comp. Journ. 17 (1974) 234\u2013241","journal-title":"Comp. Journ."},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens\/G. Rozenberg: On the structure of Node Label Controlled Graph Languages; Inform.Sci. 20 (1980) 191\u2013216","journal-title":"Inform.Sci."},{"key":"23_CR14","unstructured":"M.Kaul: Syntaxanalyse von Graphen bei Pr\u00e4zedenz-Graph-Grammatiken; Techn. Report MIP-8610, Uni. Passau, West-Germany"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"D.E.Knuth: Semantic of Context-free Languages; Math. Syst. Theo. (1968)","DOI":"10.1007\/BF01692511"},{"key":"23_CR16","unstructured":"C.Lewerentz\/M.Nagl: A Formal Specification Language for Software Systems Defined by Graph Grammars; in U.Pape (Ed.):Proc. WG'84, Workshop on Graphtheor. Conc. in Computer Science, June 13\u201315, Berlin (1984)"},{"key":"23_CR17","first-page":"70","volume":"100","author":"H. Ludwigs","year":"1981","unstructured":"H. Ludwigs: Properties of Ordered Graph Grammars; in: H.Noltemeier(Ed.): Graphtheoretic Concepts in Comp. Science; LNCS 100, Springer (1981) 70\u201379","journal-title":"LNCS"},{"key":"23_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-01443-0","volume-title":"Graph-Grammatiken \u2014 Theorie, Implementierung, Anwendung","author":"M. Nagl","year":"1979","unstructured":"M. Nagl: Graph-Grammatiken \u2014 Theorie, Implementierung, Anwendung; Vieweg, Braunschweig (1979)"},{"key":"23_CR19","unstructured":"M.Nagao: Control Strategies in Pattern Analysis; Proc. Pat. Rec. Vol. I, 6th Int. Conf., Munich 1982 (1982) 996\u20131006"},{"key":"23_CR20","unstructured":"A.Rosenfeld: Image Analysis: Progress, Problems, and Prospects; Proc. Pat. Rec. Vol. I, 6th Int. Conf., Munich 1982 (1982) 7\u201315"},{"key":"23_CR21","volume-title":"Spezifikation und Generierung von \u00dcbersetzern f\u00fcr Graph-Sprachen durch attributierte Graph-Grammatiken","author":"A. Sch\u00fctte","year":"1987","unstructured":"A. Sch\u00fctte: Spezifikation und Generierung von \u00dcbersetzern f\u00fcr Graph-Sprachen durch attributierte Graph-Grammatiken; Dissertation, Express Edition (Reihe Informatik), Berlin 1987.","edition":"Express Edition"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"L.G.Shapiro\/R.M.Haralick: Structural Descriptions and Inexact Matching;IEEE Trans. Pat. Ana. PAMI-3, No. 5 (1981)","DOI":"10.1109\/TPAMI.1981.4767144"}],"container-title":["Lecture Notes in Computer Science","Graph-Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18771-5_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:35Z","timestamp":1605644135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}