{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T13:21:45Z","timestamp":1704028905484},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":4580,"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":[[2001,1]]},"DOI":"10.1016\/s0304-3975(99)00138-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:32:20Z","timestamp":1027607540000},"page":"247-264","source":"Crossref","is-referenced-by-count":1,"title":["Double Greibach operator grammars"],"prefix":"10.1016","volume":"250","author":[{"given":"Changwook","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00138-3_BIB1","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\/S0304-3975(99)00138-3_BIB2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0020-0190(92)90101-Z","article-title":"An elementary proof of double Greibach normal form","volume":"44","author":"Engelfriet","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00138-3_BIB3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01178511","article-title":"Context-free graph languages of bounded degree are generated by apex graph grammars","volume":"31","author":"Engelfriet","year":"1994","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00138-3_BIB4","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0890-5401(89)90030-8","article-title":"Linear graph grammars","volume":"81","author":"Engelfriet","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00138-3_BIB5","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF00279953","article-title":"Apex graph grammars and attribute grammars","volume":"25","author":"Engelfriet","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00138-3_BIB6","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":"Engelfriet","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00138-3_BIB7","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1145\/321172.321179","article-title":"Syntactic analysis and operator precedence","volume":"10","author":"Floyd","year":"1963","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00138-3_BIB8","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","article-title":"A new normal-form theorem for context-free phrase-structure grammars","volume":"12","author":"Greibach","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00138-3_BIB9","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0304-3975(99)00138-3_BIB10","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(99)00138-3_BIB11","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1145\/322017.322020","article-title":"On equivalence and containment problems for formal languages","volume":"24","author":"Hunt III","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00138-3_BIB12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0304-3975(97)86542-5","article-title":"A hierarchy of eNCE families of graph languages","volume":"186","author":"Kim","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00138-3_BIB13","unstructured":"C. Kim, Efficient recognition algorithms for boundary and linear eNCE graph languages, submitted for publication."},{"key":"10.1016\/S0304-3975(99)00138-3_BIB14","doi-asserted-by":"crossref","unstructured":"C. Kim, T.E. Jeong, HRNCE grammars \u2013 A hypergraph generating system with an eNCE way of rewriting, Theoret. Comput. Sci., in press.","DOI":"10.1007\/3-540-61228-9_100"},{"key":"10.1016\/S0304-3975(99)00138-3_BIB15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0304-3975(93)90290-A","article-title":"Separating k-separated eNCE graph languages","volume":"120","author":"Kim","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00138-3_BIB16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1006\/inco.1995.1029","article-title":"Node replacement graph languages squeezed with chains, trees, and forests","volume":"117","author":"Kim","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00138-3_BIB17","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/321406.321412","article-title":"Matrix equations and normal forms for context-free grammars","volume":"14","author":"Rosenkrantz","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00138-3_BIB18","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","article-title":"Boundary NLC graph grammars \u2013 Basic definitions, normal forms, and complexity","volume":"69","author":"Rozenberg","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00138-3_BIB19","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/S0304-3975(99)00138-3_BIB20","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(85)90173-2","article-title":"On Greibach normal form construction","volume":"40","author":"Urbanek","year":"1985","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001383?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001383?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T12:33:15Z","timestamp":1704025995000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0304397599001383"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00138-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}