{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:48:35Z","timestamp":1648594115750},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2002,5,8]],"date-time":"2002-05-08T00:00:00Z","timestamp":1020816000000},"content-version":"unspecified","delay-in-days":37,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2002,4]]},"abstract":"Confluent node-rewriting hypergraph grammars represent the most comprehensive known \nmethod for defining sets of hypergraphs in a recursive way. For a large natural subclass of \nthese grammars, we show that the maximal rank of hyperedges indispensable for generating \nsome set of hypergraphs equals the maximal rank of the hyperedges occurring in the \nhypergraphs of that set. Moreover, if such a grammar generates a set of graphs, one can \nconstruct from that grammar a C-edNCE graph grammar generating the same set of graphs.<\/jats:p>","DOI":"10.1017\/s0960129501003528","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T23:18:00Z","timestamp":1027898280000},"page":"135-148","source":"Crossref","is-referenced-by-count":1,"title":["Normal forms for context-free node-rewriting hypergraph grammars"],"prefix":"10.1017","volume":"12","author":[{"given":"RENATE","family":"KLEMPIEN-HINRICHS","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2002,5,8]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129501003528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T19:24:46Z","timestamp":1553887486000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129501003528\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0960129501003528"],"URL":"https:\/\/doi.org\/10.1017\/s0960129501003528","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}