{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:27:27Z","timestamp":1767929247388,"version":"3.49.0"},"reference-count":30,"publisher":"Elsevier BV","issue":"2","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":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1991,10]]},"DOI":"10.1016\/0022-0000(91)90018-z","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"328-360","source":"Crossref","is-referenced-by-count":37,"title":["The string generating power of context-free hypergraph grammars"],"prefix":"10.1016","volume":"43","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\/0022-0000(91)90018-Z_bib1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0019-9958(71)90706-6","article-title":"Translations on a context-free grammar","volume":"19","author":"Aho","year":"1971","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(91)90018-Z_bib2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1051\/ita\/1983170200971","article-title":"Relational data base design using refinement rules","volume":"17","author":"Batini","year":"1983","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0022-0000(91)90018-Z_bib3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","article-title":"Graph expressions and graph rewritings","volume":"20","author":"Bauderon","year":"1987","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(91)90018-Z_bib4","series-title":"Graph-Grammars and Their Application to Computer Science and Biology","volume":"Vol. 73","year":"1979"},{"key":"10.1016\/0022-0000(91)90018-Z_bib5","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs. I. Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0022-0000(91)90018-Z_bib6","unstructured":"B. Courcelle, personal communication."},{"key":"10.1016\/0022-0000(91)90018-Z_bib7","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\/0022-0000(91)90018-Z_bib8","series-title":"Proceedings of the Second French-Japanese Seminar on Artificial Intelligence","article-title":"On the use of context-free graph grammars for analysing recursive definitions","author":"Courcelle","year":"1988"},{"key":"10.1016\/0022-0000(91)90018-Z_bib9","first-page":"161","article-title":"Some applications of logic, of universal algebra, and of category theory to the theory of graph transformations","volume":"36","author":"Courcelle","year":"1988","journal-title":"Bull. EATCS"},{"key":"10.1016\/0022-0000(91)90018-Z_bib10","series-title":"Graph-Grammars and Their Application to Computer Science","volume":"Vol. 291","year":"1987"},{"key":"10.1016\/0022-0000(91)90018-Z_bib11","series-title":"Graph-Grammars and Their Application to Computer Science","volume":"Vol. 153","year":"1983"},{"key":"10.1016\/0022-0000(91)90018-Z_bib12","series-title":"Essays on Concepts, Formalisms, and Tools","first-page":"43","article-title":"Generating strings with hypergraph grammars","author":"Engelfriet","year":"1987"},{"key":"10.1016\/0022-0000(91)90018-Z_bib13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(81)90466-6","article-title":"Passes and paths of attribute grammars","volume":"49","author":"Engelfriet","year":"1981","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(91)90018-Z_bib14","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. and Comput."},{"key":"10.1016\/0022-0000(91)90018-Z_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. and Comput."},{"key":"10.1016\/0022-0000(91)90018-Z_bib16","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","article-title":"Tree transducers, L systems, and two-way machines","volume":"20","author":"Engelfriet","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(91)90018-Z_bib17","series-title":"Tree Automata","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/0022-0000(91)90018-Z_bib18","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(78)90035-X","article-title":"One-way finite visit automata","volume":"6","author":"Greibach","year":"1978","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0022-0000(91)90018-Z_bib19","series-title":"STACS 1987 Proceedings","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\/0022-0000(91)90018-Z_bib20","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\/0022-0000(91)90018-Z_bib21","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(91)90018-Z_bib22","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1051\/ita\/1983170201631","article-title":"Hypergraph systems and their extensions","volume":"17","author":"Janssens","year":"1983","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0022-0000(91)90018-Z_bib23","series-title":"The Book of L","first-page":"217","article-title":"Rule trees represent derivations in edge replacement systems","author":"Kreowski","year":"1986"},{"key":"10.1016\/0022-0000(91)90018-Z_bib24","series-title":"CAAP 1988 Proceedings","first-page":"28","article-title":"Decomposition trees: structured graph representation and efficient algorithms","volume":"Vol. 299","author":"Lautemann","year":"1988"},{"key":"10.1016\/0022-0000(91)90018-Z_bib25","series-title":"ICALP 1988 Proceedings","first-page":"362","article-title":"Efficient algorithms on context-free graph languages,","volume":"317","author":"Lautemann","year":"1988"},{"key":"10.1016\/0022-0000(91)90018-Z_bib26","series-title":"Graph-Grammars and Their Application to Computer Science","first-page":"440","article-title":"An efficient algorithm for the solution of hierarchical networks of contraints","volume":"Vol. 291","author":"Montanari","year":"1987"},{"key":"10.1016\/0022-0000(91)90018-Z_bib27","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321679.321682","article-title":"Linear and context-free graph grammars","volume":"19","author":"Pavlidis","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(91)90018-Z_bib28","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/S0022-0000(72)80025-4","article-title":"Absolutely parallel grammars and two-way finite-state transducers","volume":"6","author":"Rajlich","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(91)90018-Z_bib29","series-title":"The mathematical theory of L systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0022-0000(91)90018-Z_bib30","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","article-title":"Characterizing derivation trees of context-free grammars through a generalization of finite automata theory","volume":"1","author":"Thatcher","year":"1967","journal-title":"J. Comput. System Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009190018Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009190018Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:56:30Z","timestamp":1550307390000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009190018Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["002200009190018Z"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(91)90018-z","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}