{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:27Z","timestamp":1725455907323},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023447","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:06:33Z","timestamp":1132383993000},"page":"47-54","source":"Crossref","is-referenced-by-count":6,"title":["Greibach normal form transformation, revisited"],"prefix":"10.1007","author":[{"given":"Robert","family":"Koch","sequence":"first","affiliation":[]},{"given":"Norbert","family":"Blum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"4_CR1","unstructured":"A. V. Aho, and J. D. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing, Prentice-Hall (1972)."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(82)90122-0","volume":"27","author":"N. Blum","year":"1983","unstructured":"N. Blum, More on the power of chain rules in context-free grammars, TCS\n27 (1983), 287\u2013295.","journal-title":"TCS"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S. A. Greibach","year":"1965","unstructured":"S. A. Greibach, A new normal-form theorem for context-free, phrase-structure grammars, JACM\n12 (1965), 42\u201352.","journal-title":"JACM"},{"key":"4_CR4","unstructured":"M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley (1978)."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1093\/comjnl\/24.2.156","volume":"24","author":"M. A. Harrison","year":"1981","unstructured":"M. A. Harrison, and A. Yehudai, Eliminating null rules in linear time, The Computer Journal\n24 (1981), 156\u2013161.","journal-title":"The Computer Journal"},{"key":"4_CR6","unstructured":"J. E. Hopcroft, and J. D. Ullman, Introduction to Autmata Theory, Languages, and Computation, Addison-Wesley (1979)."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(83)90026-9","volume":"28","author":"A. Kelemenov\u00e1","year":"1984","unstructured":"A. Kelemenov\u00e1, Complexity of normal form grammars, TCS\n28 (1984), 299\u2013314.","journal-title":"TCS"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/321406.321412","volume":"14","author":"D. J. Rosenkrantz","year":"1967","unstructured":"D. J. Rosenkrantz, Matrix equations and normal forms for context-free grammers, JACM\n14 (1967), 501\u2013507.","journal-title":"JACM"},{"key":"4_CR9","unstructured":"D. Wood, Theory of Computation, Harper & Row (1987)."}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T22:47:47Z","timestamp":1549320467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0023447","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}