{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:49:14Z","timestamp":1770994154361,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540187714","type":"print"},{"value":"9783540481782","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18771-5_48","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:49:15Z","timestamp":1330199355000},"page":"99-111","source":"Crossref","is-referenced-by-count":16,"title":["On partially ordered graph grammars"],"prefix":"10.1007","author":[{"given":"Franz J.","family":"Brandenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(86)90070-3","volume":"13","author":"IJ.J. Aalbersberg","year":"1986","unstructured":"IJ.J. Aalbersberg, A. Ehrenfeucht and G. Rozenberg, \"On the membership problem for regular DNLC grammars\". Discrete Applied Mathematics 13 (1986), 79\u201385.","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR2","unstructured":"IJ.J. Aalbersberg, J. Engelfriet and G. Rozenberg, \"The complexity of regular DNLC graph languages\". Report 86-03, Rijksuniversiteit Leiden (1986)."},{"key":"9_CR3","unstructured":"F. J. Brandenburg, \"On the complexity of the membership problem of graph grammars\", in: Proceedings of the Workshop on Graphtheoretic Concepts in Computer Science 83, M.Nagl and J. Perl, eds., Tauner-Verlag Linz (1983), 40\u201349."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"V. Claus, H. Ehrig, and G Rozenberg (eds.), \"Graph Grammars and their Application to Computer Science and Biology\", Lecture Notes in Computer Science 73 (1980).","DOI":"10.1007\/BFb0025713"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0304-3975(84)90135-X","volume":"31","author":"A. Ehrenfeucht","year":"1984","unstructured":"A. Ehrenfeucht, M. Main and G. Rozenberg, \"Restrictions on NLC graph grammars\", Theoret. Comput. Sci 31 (1984), 211\u2013223.","journal-title":"Theoret. Comput. Sci"},{"key":"9_CR6","volume-title":"Computers and Intractability \u2014 A Guide to the Theory of NP Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, \"Computers and Intractability \u2014 A Guide to the Theory of NP Completeness\", Freeman, San Francisco (1979)."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF00975630","volume":"5","author":"R.C. Gonzales","year":"1976","unstructured":"R.C. Gonzales, J.J. Edwards and M.G. Thomason, \"An algorithm for the inference of tree grammars\", Int. J. Comput. Inform. Sci, 5 (1976), 145\u2013164.","journal-title":"Int. J. Comput. Inform. Sci"},{"key":"9_CR8","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary, \"Graph Theory\", Addison Wesley, Reading (1969)."},{"key":"9_CR9","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1979","unstructured":"M.A. Harrison, \"Introduction to Formal Language Theory\", Addison Wesley, Reading, (1979)."},{"key":"9_CR10","unstructured":"D.Janssens, \"Node label controlled graph grammers\", Ph.D. thesis, University of Antwerp, (1983)."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens and G. Rozenberg, \"On the structure of node label controlled graph languages\", Information Sciences 20 (1980), 191\u2013216.","journal-title":"Information Sciences"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens and G. Rozenberg, \"Restrictions, extensions, and variations of NLC grammars\", Information Sciences 20 (1980), 217\u2013244.","journal-title":"Information Sciences"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00289591","volume":"16","author":"D. Janssens","year":"1981","unstructured":"D. Janssens and G. Rozenberg, \"A characterization of context-free string languages by directed node-label controlled graph grammars\", Acta Informatica 16 (1981), 63\u201385.","journal-title":"Acta Informatica"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-0000(81)90025-8","volume":"22","author":"D. Janssens","year":"1981","unstructured":"D. Janssens and G. Rozenberg, \"Decision problems for node label controlled graph grammars\", J. Comput. System Sci. 22 (1981), 144\u2013177.","journal-title":"J. Comput. System Sci."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(82)90088-3","volume":"7","author":"D. Janssens","year":"1982","unstructured":"D. Janssens and G. Rozenberg, \"Graph grammars with neighbourhood-controlled embedding\", Theoret. Comput. Sci. 7 (1982), 55\u201374.","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR16","unstructured":"M. Kaul, \"Syntaxanalyse von Graphen bei Pr\u00e4zedenz-Graph-Grammatiken\", Technical Report MIP 8610, Universit\u00e4t Passau, (1986)."},{"key":"9_CR17","unstructured":"M. Kaul, \"Practical applications of precedence graph grammars\", this volume."},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0166-218X(87)90051-5","volume":"16","author":"K.-J. Lange","year":"1987","unstructured":"K.-J. Lange, E. Welzl, \"String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing\", Discrete Applied Mathematics 16, 1987, 17\u201330.","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/3-540-10291-4_6","volume":"100","author":"H.J. Ludwigs","year":"1981","unstructured":"H.J. Ludwigs, \"Properties of ordered graph grammars\", Lecture Notes in Computer Science 100 (1981), 70\u201377.","journal-title":"Lecture Notes in Computer Science"},{"key":"9_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-01443-0","volume-title":"Graph-Grammatiken Theorie, Implementierung, Anwendungen","author":"M. Nagl","year":"1979","unstructured":"M. Nagl, \"Graph-Grammatiken Theorie, Implementierung, Anwendungen\", Vieweg Verlag, Braunschweig (1979)."},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg and E. Welzl, \"Boundary NLC graph grammars \u2014 basic definitions, normal forms, and complexity\", Inform. and Control 69 (1986), 136\u2013167.","journal-title":"Inform. and Control"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF00289115","volume":"23","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg and E. Welzl, \"Graph theoretic closure properties of the family boundary NLC graph languages\", Acta Informatica 23 (1986), 289\u2013309.","journal-title":"Acta Informatica"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(87)90054-0","volume":"16","author":"G. Rozenberg","year":"1987","unstructured":"G. Rozenberg and E. Welzl, \"Combinatorial properties of boundary NLC graph languages\", Discrete Applied Mathematics 16 (1987), 59\u201373.","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR24","unstructured":"R. Schuster, \"Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexit\u00e4t\" Dissertation, Universit\u00e4t Passau, (1987)."},{"key":"9_CR25","unstructured":"Q. Y. Shi and K. S. Fu, \"Parsing and translation of (attributed) expansive graph languages for science analysis\", Proc. 6 ICPR, Munich (1982), 684\u2013687."},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/0020-0190(82)90086-2","volume":"14","author":"A. O. Slisenko","year":"1982","unstructured":"A. O. Slisenko, \"Context-free grammars as a tool for describing polynomial-time subclasses of hard problems\", Inform. Process. Letters 14 (1982), 52\u201356.","journal-title":"Inform. Process. Letters"}],"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_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:31Z","timestamp":1605644131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}