{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:36:46Z","timestamp":1703187406702},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":4337,"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,9]]},"DOI":"10.1016\/s0304-3975(00)00294-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:49:41Z","timestamp":1027601381000},"page":"35-47","source":"Crossref","is-referenced-by-count":21,"title":["Normal form algorithms for extended context-free grammars"],"prefix":"10.1016","volume":"267","author":[{"given":"J\u00fcrgen","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dora","family":"Giammarresi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00294-2_BIB1","series-title":"The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing","author":"Aho","year":"1972"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB2","unstructured":"K.R. Barnes, Exploratory steps towards a grammatical manipulation package (GRAMPA), Master's Thesis, McMaster University, Hamilton, Ontario, Canada, 1972."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","article-title":"Derivatives of regular expressions","volume":"11","author":"Brzozowski","year":"1964","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB4","unstructured":"H.A. Cameron, D. Wood, Structural equivalence of extended context-free and extended E0L grammars, 2000, to appear."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/356561.356565","article-title":"A list structure form of grammars for syntactic analysis","volume":"2","author":"Cohen","year":"1970","journal-title":"Comput. Surveys"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB6","unstructured":"D. Connolly, W3C web page on XML. http:\/\/www.w3.org\/XML\/, 1997."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(84)80013-3","article-title":"An easy proof of Greibach normal form","volume":"63","author":"Ehrenfeucht","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB8","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/44128.214376","article-title":"Dagwood","volume":"14","author":"Freeman","year":"1988","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB9","unstructured":"D. Giammarresi, D. Wood, Transition diagram systems and normal form transformations, Proceedings of the Sixth Italian Conference on Theoretical Computer Science, Singapore, 1998, World Scientific, Singapore."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB10","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(00)00294-2_BIB11","series-title":"A simple proof of the standard-form theorem for context-free grammars, Technical report","author":"Greibach","year":"1967"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB12","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB13","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1093\/comjnl\/24.2.156","article-title":"Eliminating null rules in linear time","volume":"24","author":"Harrison","year":"1981","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB14","first-page":"65","article-title":"Normal-form transformations of context-free grammars","volume":"4","author":"Hotz","year":"1978","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB15","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0022-0000(76)80038-4","article-title":"On the equivalence, containment and covering problems for the regular and context-free languages","volume":"12","author":"Hunt III","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB16","unstructured":"ISO 8879: Information processing \u2013 Text and office systems \u2013 Standard Generalized Markup Language (SGML), International Organization for Standardization, October 1986."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB17","first-page":"39","article-title":"SGML and exceptions","volume":"vol. 1293","author":"Kilpel\u00e4inen","year":"1997"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB18","first-page":"47","article-title":"Greibach normal form transformation revisited","volume":"vol. 1200","author":"Koch","year":"1997"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB19","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1006\/jsco.1994.1023","article-title":"Grail","volume":"17","author":"Raymond","year":"1994","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB20","unstructured":"D.R. Raymond, D. Wood, Grail: engineering automata in C++, version 2.5. Technical Report HKUST-CS96-24, Department of Computer Science, Hong Kong University of Science & Technology, Clear Water Bay, Kowloon, Hong Kong, 1996."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB21","series-title":"Grammar transformations based on regular decompositions of context-free derivations, Ph.D. Thesis, Department of Computer Science","author":"Ross","year":"1978"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB22","series-title":"A general Greibach normal form transformation. Technical Report CS-78-048, Department of Computer Science","author":"Ross","year":"1978"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB23","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB24","series-title":"Theory of Computation","author":"Wood","year":"1987"},{"key":"10.1016\/S0304-3975(00)00294-2_BIB25","unstructured":"D. Wood, Theory of Computation, 2nd Edition, Wiley, New York, NY, 2000, in preparation."},{"key":"10.1016\/S0304-3975(00)00294-2_BIB26","unstructured":"A. Yehudai, On the complexity of grammar and language problems, Ph.D. Thesis, University of California, Berkeley, CA, 1977."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002942?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002942?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T11:56:40Z","timestamp":1556193400000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0304397500002942"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00294-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}