{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:50:57Z","timestamp":1688489457707},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1007\/bf00289115","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T17:55:24Z","timestamp":1096912524000},"page":"289-309","source":"Crossref","is-referenced-by-count":38,"title":["Graph theoretic closure properties of the family of boundary NLC graph languages"],"prefix":"10.1007","volume":"23","author":[{"given":"Grzegorz","family":"Rozenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. London: Macmillan 1976"},{"key":"CR2","first-page":"40","volume-title":"Proceedings of the WG 83","author":"F.J. Brandenburg","year":"1983","unstructured":"Brandenburg, F.J.: On the complexity of the membership problem for graph grammars. In: Proceedings of the WG 83. (M. Nagl and J. Perl eds.), pp. 40?49. Linz: Universit\ufffdtsverlag Trauner 1983"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0304-3975(84)90135-X","volume":"31","author":"A. Ehrenfeucht","year":"1984","unstructured":"Ehrenfeucht, A., Main, M.G., Rozenberg, G.: Restrictions on NLC grammars. Theor. Comput. Sci. 31, 211?223 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0025714","volume":"73","author":"H. Ehrig","year":"1979","unstructured":"Ehrig, H.: Introduction to the algebraic theory of graph grammars. Lect. Notes Comput. Sci. 73, 1?69 (1979)","journal-title":"Lect. Notes Comput. Sci."},{"key":"CR5","volume-title":"Computers and Intractability. A Guide to the Theory of NP- completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP- completeness. San Francisco: Freeman 1979"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237?267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"CR7","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S.: The Mathematical Theory of Context-Free Languages. New York: McGraw-Hill 1966"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","volume":"5","author":"E.H. Gurari","year":"1984","unstructured":"Gurari, E.H., Sudborough, I.H.: Improved dynamic programming algorithms for bandwidth minimization and the min-cut arrangement problem. J. Algorithms 5, 531?546 (1984)","journal-title":"J. Algorithms"},{"key":"CR9","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Reading, M.A.: Addison Wesley 1969"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Janssens, D.: Node Label Controlled Graph Grammars. Ph.D. Thesis, University of Antwerp 1983","DOI":"10.1007\/BFb0000107"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"Janssens, D., Rozenberg, G.: On the structure of node label controlled graph languages. Inf. Sci. 20, 191?216 (1980)","journal-title":"Inf. Sci."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","volume":"20","author":"D. Janssens","year":"1980","unstructured":"Janssens, D., Rozenberg, G.: Restrictions, extensions, and variations of NLC grammars. Inf. Sci. 20, 217?244 (1980)","journal-title":"Inf. Sci."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-0000(81)90025-8","volume":"22","author":"D. Janssens","year":"1981","unstructured":"Janssens, D., Rozenberg, G.: Decision problems for node label controlled graph grammars. J. Comput. Syst. Sci. 22, 144?174 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Janssens, D., Rozenberg, G., Welzl, E.: The bounded degree problem for NLC grammars is decidable. J. Comput. Syst. Sci. (1986, in press)","DOI":"10.1016\/0022-0000(86)90060-7"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/BFb0025715","volume":"73","author":"M. Nagl","year":"1979","unstructured":"Nagl, M.: A tutorial and bibliographical survey of graph grammars. Lect. Notes Comput. Sci. 73, 70?126 (1979)","journal-title":"Lect. Notes Comput. Sci."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Welzl, E.: Boundary NLC graph grammars ? basic definitions, normal forms and complexity. Inf. Control (1986, in press)","DOI":"10.1016\/S0019-9958(86)80045-6"},{"key":"CR17","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. London: Academic Press 1973"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"J.B. Saxe","year":"1980","unstructured":"Saxe, J.B.: Dynamic programming algorithms for recognizing small band width graphs in polynomial time. SIAM J. Algebraic Discrete Methods 1, 363?369 (1980)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"CR19","first-page":"271","volume":"6","author":"G. Tur\ufffdn","year":"1983","unstructured":"Tur\ufffdn, G.: On the complexity of graph grammars. Acta Cybern. 6, 271?281 (1983)","journal-title":"Acta Cybern."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289115.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289115\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:40Z","timestamp":1554758080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["BF00289115"],"URL":"https:\/\/doi.org\/10.1007\/bf00289115","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}