{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:29:46Z","timestamp":1725467386354},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612285"},{"type":"electronic","value":"9783540683889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_89","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T14:17:05Z","timestamp":1153145825000},"page":"211-224","source":"Crossref","is-referenced-by-count":0,"title":["The bounded degree problem for non-obstructing eNCE graph grammars"],"prefix":"10.1007","author":[{"given":"K.","family":"Skodinis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Wanke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"F.J. Brandenburg. On partially ordered graph grammars. In H. Ehrig, M. Nagl, A. Rosenfeld, and G. Rozenberg, editors, Proceedings of Graph-Grammars and Their Application to Computer Science, volume 291 of LNCS, pages 99\u2013111. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18771-5_48"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(90)90002-3","volume":"40","author":"J. Engelfriet","year":"1990","unstructured":"J. Engelfriet, G. Leih, and E. Welzl. Boundary graph grammars with dynamic edge relabeling. Journal of Computer and System Sciences, 40:307\u2013345, 1990.","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR3","unstructured":"A. Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of LNCS. Springer-Verlag, 1992."},{"issue":"4","key":"15_CR4","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760\u2013778, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"15_CR5","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 and G. Rozenberg. On the structure of node label controlled graph languages. Information Science, 20:191\u2013216, 1980.","journal-title":"Information Science"},{"key":"15_CR6","doi-asserted-by":"crossref","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 Science, 20:217\u2013244, 1980.","journal-title":"Information Science"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0022-0000(86)90060-7","volume":"33","author":"D. Janssens","year":"1986","unstructured":"D. Janssens, G. Rozenberg, and E. Welzl. The bounded degree problem for NLC graph grammars is decidable. Journal of Computer and System Sciences, 33:415\u2013422, 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR8","volume-title":"Dissertation","author":"M. Kaul","year":"1985","unstructured":"M. Kaul. Syntaxanalyse von Graphen bei Pr\u00e4zedenz-Graphgrammatiken. Dissertation, Universit\u00e4t Osnabr\u00fcck, Osnabr\u00fcck, Germany, 1985."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"M. Kaul. Practical applications of precedence graph grammars. In H. Ehrig, M. Nagl, A. Rosenfeld, and G. Rozenberg, editors, Proceedings of Graph-Grammars and Their Application to Computer Science, volume 291 of LNCS, pages 326\u2013342. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18771-5_62"},{"key":"15_CR10","volume-title":"Technical Report 12\/93","author":"A. Monti","year":"1993","unstructured":"A. Monti and A. Roncato. On the computational complexity of some decidable problems for EOL systems and BSTA. Technical Report 12\/93, University of Pisa, I-56125 Pisa,Italy, 1993."},{"key":"15_CR11","first-page":"180","volume":"903","author":"K. Skodinis","year":"1994","unstructured":"K. Skodinis and E. Wanke. The Complexity of Emptiness Problems of eNCE Graph Languages. LNCS, 903:180\u2013192, 1994, to appear in Journal of Computer and System Sciences.","journal-title":"LNCS"}],"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-61228-9_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T11:54:45Z","timestamp":1549454085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}