{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:08:19Z","timestamp":1648696099392},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1016\/0020-0255(93)90080-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"241-269","source":"Crossref","is-referenced-by-count":2,"title":["Representing graph families with edge grammars"],"prefix":"10.1016","volume":"70","author":[{"given":"Francine","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory E.","family":"Shannon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(93)90080-6_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0255(93)90080-6_BIB2","series-title":"Proceedings of the 21st Annual Allerton Conference on Communication, Control, and Computing","first-page":"214","article-title":"Edge grammars and parallel computation","author":"Berman","year":"1983"},{"key":"10.1016\/0020-0255(93)90080-6_BIB3","article-title":"A guide to the Poker mapping preprocessor","author":"Berman","year":"1984"},{"key":"10.1016\/0020-0255(93)90080-6_BIB4","series-title":"Proceedings of the 22nd Annual Allerton Conference on Communication, Control, and Computer","first-page":"921","article-title":"Edge grammars: decidability results and formal language issues","author":"Berman","year":"1984"},{"key":"10.1016\/0020-0255(93)90080-6_BIB5","series-title":"Proceedings of the 1984 International Conference on Parallel Processing","first-page":"307","article-title":"On mapping parallel algorithms into parallel architectures","author":"Berman","year":"1984"},{"key":"10.1016\/0020-0255(93)90080-6_BIB6","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","article-title":"A framework for solving VLSI graph layout problems","volume":"28","author":"Bhatt","year":"1984","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0020-0255(93)90080-6_BIB7","article-title":"The tree machine: A highly concurrent programming environment","author":"Browning","year":"1980"},{"key":"10.1016\/0020-0255(93)90080-6_BIB8","article-title":"Graph Grammars and Their Application to Computer Science and Biology","volume":"vol. 73","author":"Claus","year":"1979"},{"key":"10.1016\/0020-0255(93)90080-6_BIB9","series-title":"Graph Grammars and Their Application to Computer Science\u20142nd International Workshop","volume":"vol. 153","author":"Ehrig","year":"1983"},{"key":"10.1016\/0020-0255(93)90080-6_BIB10","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/S0019-9958(66)80003-7","article-title":"Turing machines with restricted memory access","volume":"9","author":"Fischer","year":"1966","journal-title":"Inform. Control"},{"key":"10.1016\/0020-0255(93)90080-6_BIB11","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0020-0255(93)90080-6_BIB12","series-title":"Introduction to Automata Theory Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0255(93)90080-6_BIB13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","article-title":"On the structure of node-label controlled graph languages","volume":"20","author":"Janssens","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/0020-0255(93)90080-6_BIB14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","article-title":"Restrictions extensions and variations of NLC grammars","volume":"20","author":"Janssens","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/0020-0255(93)90080-6_BIB15","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"issue":"6","key":"10.1016\/0020-0255(93)90080-6_BIB16","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/S0022-0000(71)80016-8","article-title":"Pair grammars graph languages and string-to-graph translations","volume":"5","author":"Pratt","year":"1971","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0020-0255(93)90080-6_BIB17","article-title":"Algorithm design and VLSI architecture","author":"Preparata","year":"1982"},{"key":"10.1016\/0020-0255(93)90080-6_BIB18","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01776564","article-title":"Bounds on the costs of data encodings","volume":"12","author":"Rosenberg","year":"1978","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/0020-0255(93)90080-6_BIB19","first-page":"307","article-title":"Web automata and web grammars","volume":"7","author":"Rosenfeld","year":"1972","journal-title":"Mach. Intell."},{"key":"10.1016\/0020-0255(93)90080-6_BIB20","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"issue":"4","key":"10.1016\/0020-0255(93)90080-6_BIB21","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"10.1016\/0020-0255(93)90080-6_BIB22","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0255(93)90080-6_BIB23","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"},{"issue":"2","key":"10.1016\/0020-0255(93)90080-6_BIB24","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations in VLSI circuits","volume":"C-30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025593900806?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025593900806?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:28:29Z","timestamp":1552915709000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025593900806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["0020025593900806"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(93)90080-6","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}