{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T06:32:22Z","timestamp":1768372342571,"version":"3.49.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":7106,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/s0022-0000(05)80022-4","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T07:18:35Z","timestamp":1124522315000},"page":"58-89","source":"Crossref","is-referenced-by-count":6,"title":["Hypergraph languages of bounded degree"],"prefix":"10.1016","volume":"48","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"Heyker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80022-4_bib1","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\/S0022-0000(05)80022-4_bib2","series-title":"Proceedings, STACS 88","first-page":"227","article-title":"On polynomial time graph grammars","volume":"Vol. 294","author":"Brandenburg","year":"1988"},{"key":"10.1016\/S0022-0000(05)80022-4_bib3","series-title":"Rewriting Techniques and Applications","first-page":"312","article-title":"The equivalence of boundary and confluent graph grammars on graph languages of bounded degree","volume":"Vol. 488","author":"Brandenburg","year":"1991"},{"key":"10.1016\/S0022-0000(05)80022-4_bib4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","article-title":"An axiomatic definition of context-free rewriting and its application to NLC graph grammars","volume":"55","author":"Courcelle","year":"1987","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80022-4_bib5","article-title":"A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars","author":"Courcelle","year":"1991","journal-title":"Report 91-41"},{"key":"10.1016\/S0022-0000(05)80022-4_bib6","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","article-title":"Handle-Rewriting Hypergraph Grammars","volume":"46","author":"Courcelle","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80022-4_bib7","series-title":"Graph-Grammars and Their Application to Computer Science","first-page":"253","article-title":"Context-free handle-rewriting hypergraph grammars","volume":"Vol. 532","author":"Courcelle","year":"1991"},{"key":"10.1016\/S0022-0000(05)80022-4_bib8","series-title":"Proceedings FCT '89","first-page":"148","article-title":"Context-free NCE graph grammars","volume":"Vol. 380","author":"Engelfriet","year":"1989"},{"key":"10.1016\/S0022-0000(05)80022-4_bib9","series-title":"Proceedings, ICALP '92","first-page":"138","article-title":"A Greibach normal form for context-free graph grammars","volume":"Vol. 623","author":"Engelfriet","year":"1992"},{"key":"10.1016\/S0022-0000(05)80022-4_bib10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01178504","article-title":"Context-free hypergraph grammars have the same term-generating power as attribute grammars","volume":"29","author":"Engelfriet","year":"1992","journal-title":"Acta Informatica"},{"key":"10.1016\/S0022-0000(05)80022-4_bib11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","article-title":"The string generating power of context-free hypergraph grammars","volume":"43","author":"Engelfriet","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80022-4_bib12","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0890-5401(89)90030-8","article-title":"Linear graph grammars: Power and complexity","volume":"81","author":"Engelfriet","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/S0022-0000(05)80022-4_bib13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(91)90174-Z","article-title":"Nonterminal separation in graph grammars","volume":"82","author":"Engelfriet","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80022-4_bib14","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(90)90002-3","article-title":"Boundary graph grammars with dynamic edge relabeling","volume":"40","author":"Engelfiriet","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80022-4_bib15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0890-5401(90)90038-J","article-title":"A comparison of boundary graph grammars and context-free hypergraph grammars","volume":"84","author":"Engelfriet","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0022-0000(05)80022-4_bib16","article-title":"Hyperedge Replacement: Grammars and Languages","author":"Habel","year":"1989","journal-title":"Ph.D. thesis"},{"key":"10.1016\/S0022-0000(05)80022-4_bib17","series-title":"Proceedings, 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\/S0022-0000(05)80022-4_bib18","series-title":"Graph-Grammars and Their Application to Computer Science","first-page":"15","article-title":"May we introduce to you: Hyperedge replacement","volume":"Vol. 291","author":"Habel","year":"1987"},{"key":"10.1016\/S0022-0000(05)80022-4_bib19","article-title":"Syntaxanalyse von Graphen bei Pr\u00e4zedenz-Graph-Grammatiken","author":"Kaul","year":"1985","journal-title":"Ph.D. thesis"},{"key":"10.1016\/S0022-0000(05)80022-4_bib20","series-title":"Proceedings, ICALP '88","first-page":"362","article-title":"Efficient algorithms on context-free graph languages","volume":"Vol. 317","author":"Lautemann","year":"1988"},{"key":"10.1016\/S0022-0000(05)80022-4_bib21","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. Control"},{"key":"10.1016\/S0022-0000(05)80022-4_bib22","article-title":"Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexit\u00e4t","author":"Schuster","year":"1987","journal-title":"Ph.D. thesis, Report MIP-8711"},{"key":"10.1016\/S0022-0000(05)80022-4_bib23","series-title":"Graph-Theoretic Concepts in Computer Science WG '89","first-page":"78","article-title":"On hyperedge replacement and BNLC graph grammars","volume":"Vol. 411","author":"Vogler","year":"1989"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800224?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800224?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T17:27:45Z","timestamp":1548178065000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["S0022000005800224"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80022-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}