{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:12:53Z","timestamp":1768263173141,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7960,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,10]]},"DOI":"10.1016\/0304-3975(90)90106-r","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"33-62","source":"Crossref","is-referenced-by-count":18,"title":["Decidable boundedness problems for sets of graphs generated by hyperedge-replacement"],"prefix":"10.1016","volume":"89","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90106-R_BIB1","series-title":"Proc. ICALP'88","first-page":"38","article-title":"Problems easy for tree-decomposable graphs","volume":"Vol. 317","author":"Arnborg","year":"1988"},{"key":"10.1016\/0304-3975(90)90106-R_BIB2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","article-title":"Graph expressions and graph rewriting","volume":"20","author":"Bauderon","year":"1987","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(90)90106-R_BIB3","first-page":"133","article-title":"On context-free sets of graphs and their monadic second-order theory","volume":"Vol. 291","author":"Courcelle","year":"1987"},{"key":"10.1016\/0304-3975(90)90106-R_BIB4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(78)90528-4","article-title":"Context-free graph grammars","volume":"37","author":"Della Vigna","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90106-R_BIB5","series-title":"Proc. WG'88","first-page":"11","article-title":"Graph-theoretic properties compatible with graph derivations","volume":"Vol. 344","author":"Habel","year":"1989"},{"key":"10.1016\/0304-3975(90)90106-R_BIB6","series-title":"Ph.D. Thesis","article-title":"Hyperedge-replacement: grammars and languages","author":"Habel","year":"1989"},{"key":"10.1016\/0304-3975(90)90106-R_BIB7","first-page":"143","article-title":"On context-free graph languages generated by edge replacement","volume":"Vol. 153","author":"Habel","year":"1983"},{"key":"10.1016\/0304-3975(90)90106-R_BIB8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0304-3975(87)90050-8","article-title":"Characteristics of graph languages generated by edge replacement","volume":"51","author":"Habel","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90106-R_BIB9","first-page":"15","article-title":"May we introduce to you: hyperedge replacement","volume":"Vol. 291","author":"Habel","year":"1987"},{"key":"10.1016\/0304-3975(90)90106-R_BIB10","series-title":"Proc. STACS'87","first-page":"207","article-title":"Some structural aspects of hypergraph languages generated by hyperedge replacement","volume":"Vol. 247","author":"Habel","year":"1987"},{"key":"10.1016\/0304-3975(90)90106-R_BIB11","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/BF00288976","article-title":"Metatheorems for decision problems on hyperedge replacement graph languages","volume":"26","author":"Hable","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(90)90106-R_BIB12","series-title":"Proc. TAPSOFT'89","first-page":"275","article-title":"Decidable boundedness problems for hyperedge-replacement graph grammars","volume":"Vol. 351","author":"Habel","year":"1989"},{"key":"10.1016\/0304-3975(90)90106-R_BIB13","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0022-0000(86)90060-7","article-title":"The bounded degree problem for NLC grammars is decidable","volume":"33","author":"Janssens","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90106-R_BIB14","first-page":"270","article-title":"A pumping lemma for context-free graph languages","volume":"Vol. 73","author":"Kreowski","year":"1979"},{"key":"10.1016\/0304-3975(90)90106-R_BIB15","series-title":"Proc. CAAP'88","first-page":"28","article-title":"Decomposition trees: structured graph representation and efficient algorithms","volume":"Vol. 299","author":"Lautemann","year":"1988"},{"key":"10.1016\/0304-3975(90)90106-R_BIB16","series-title":"Proc. ICALP'88","first-page":"379","article-title":"Efficient analysis of graph properties on context-free graph languages","volume":"Vol. 317","author":"Lengauer","year":"1988"},{"key":"10.1016\/0304-3975(90)90106-R_BIB17","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","article-title":"Boundary NLC graph grammars\u2014Basic definitions, normal forms, and complexity","volume":"69","author":"Rozenberg","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90106-R_BIB18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF00289115","article-title":"Graph theoretic closure properties of the family of boundary NLC graph languages","volume":"23","author":"Rozenberg","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(90)90106-R_BIB19","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0020-0190(82)90086-2","article-title":"Context-free graph grammars as a tool for describing polynomial-time subclasses of hard problems","volume":"14","author":"Slisenko","year":"1982","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090106R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090106R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:41Z","timestamp":1555127741000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090106R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["030439759090106R"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90106-r","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}