{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:48:58Z","timestamp":1725486538424},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666523"},{"type":"electronic","value":"9783540480570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48057-9_1","type":"book-chapter","created":{"date-parts":[[2007,6,23]],"date-time":"2007-06-23T07:05:18Z","timestamp":1182582318000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["Extended Context-Free Grammars and Normal Form Algorithms"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dora","family":"Giammaressi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,9,17]]},"reference":[{"key":"1_CR1","volume-title":"The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing","author":"A.V. Aho","year":"1972","unstructured":"A.V. Aho and J.D. Ullman. The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1972."},{"key":"1_CR2","volume-title":"ploratory steps towards a grammatical manipulation package (GRAMPA)","author":"K.R. Barnes","year":"1972","unstructured":"K.R. Barnes. Exploratory steps towards a grammatical manipulation package (GRAMPA). Master\u2019s thesis, McMaster University, Hamilton, Ontario, Canada, 1972."},{"key":"1_CR3","unstructured":"H.A. Cameron and D. Wood. Structural equivalence of extended context-free and extended E0L grammars. In preparation, 1998."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/356561.356565","volume":"2","author":"D.J. Cohen","year":"1970","unstructured":"D.J. Cohen and C.C. Gotlieb. A list structure form of grammars for syntactic analysis. Computing Surveys, 2:65\u201382, 1970.","journal-title":"Computing Surveys"},{"key":"1_CR5","unstructured":"D. Connolly. W3C web page on XML. \n                  http:\/\/www.w3.org\/XML\/\n                  \n                , 1997."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(84)80013-3","volume":"63","author":"A. Ehrenfeucht","year":"1984","unstructured":"A. Ehrenfeucht and G. Rozenberg. An easy proof of Greibach normal form. Information and Control, 63:190\u2013199, 1984.","journal-title":"Information and Control"},{"key":"1_CR7","unstructured":"D. Giammarresi and D. Wood. Transition diagram systems and normal form transformations. In Proceedings of the Sixth Italian Conference on Theoretical Computer Science, Singapore, 1998. World Scientific Publishing Co. Pte. Ltd."},{"key":"1_CR8","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. Journal of the ACM, 12:42\u201352, 1965.","journal-title":"Journal of the ACM"},{"key":"1_CR9","series-title":"Technical report","volume-title":"A simple proof of the standard-form theorem for context-free grammar","author":"S.A. Greibach","year":"1967","unstructured":"S.A. Greibach. A simple proof of the standard-form theorem for context-free grammars. Technical report, Harvard University, Cambridge, MA, 1967."},{"key":"1_CR10","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, MA, 1978."},{"key":"1_CR11","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. Computer Journal, 24:156\u2013161, 1981.","journal-title":"Computer Journal"},{"key":"1_CR12","first-page":"65","volume":"4","author":"G. Hotz","year":"1978","unstructured":"G. Hotz. Normal-form transformations of context-free grammars. Acta Cybernetica, 4:65\u201384, 1978.","journal-title":"Acta Cybernetica"},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0022-0000(76)80038-4","volume":"12","author":"H.B. Hunt III","year":"1976","unstructured":"H.B. Hunt III, D.J. Rosenkrantz, and T.G. Szymanski. On the equivalence, containment and covering problems for the regular and context-free languages. Journal of Computer and System Sciences, 12:222\u2013268, 1976.","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR14","unstructured":"ISO 8879: Information processing\u2014Text and office systems\u2014 Standard Generalized Markup Language (SGML), October 1986. International Organization for Standardization."},{"key":"1_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-63620-X_54","volume-title":"Proceedings of the Third International Workshop on Principles of Document Processing (PODP 96)","author":"P. Kilpel\u00e4inen","year":"1997","unstructured":"P. Kilpel\u00e4inen and D. Wood. SGML and exceptions. In C. Nicholas and D. Wood, editors, Proceedings of the Third International Workshop on Principles of Document Processing (PODP 96), pages 39\u201349, Heidelberg, 1997. Springer-Verlag. Lecture Notes in Computer Science 1293."},{"key":"1_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BFb0023447","volume-title":"STACS\u201997 Proceedings","author":"R. Koch","year":"1997","unstructured":"R. Koch and N. Blum. Greibach normal form transformation revisited. In Reischuk and Morvan, editors, STACS\u201997 Proceedings, pages 47\u201354, New York, NY, 1997. Springer-Verlag. Lecture Notes in Computer Science 1200."},{"key":"1_CR17","series-title":"Technical Report","volume-title":"Grail: Engineering automata in C++, version 2.5","author":"D. R. Raymond","year":"1996","unstructured":"D. R. Raymond and 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":"1_CR18","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jsco.1994.1023","volume":"17","author":"D.R. Raymond","year":"1994","unstructured":"D.R. Raymond and D. Wood. Grail: A C++ library for automata and expressions. Journal of Symbolic Computation, 17:341\u2013350, 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"1_CR19","volume-title":"Grammar Transformations Based on Regular Decompositions of Context-Free Derivations","author":"R.J. Ross","year":"1978","unstructured":"R.J. Ross. Grammar Transformations Based on Regular Decompositions of Context-Free Derivations. PhD thesis, Department of Computer Science, Washington State University, Pullman, WA, USA, 1978."},{"key":"1_CR20","series-title":"Technical Report","volume-title":"A general Greibach normal form transformation","author":"R.J. Ross","year":"1978","unstructured":"R.J. Ross, G. Hotz, and D.B. Benson. A general Greibach normal form transformation. Technical Report CS-78-048, Department of Computer Science, Washington State University, Pullman, WA, USA, 1978."},{"key":"1_CR21","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"A. Salomaa. Formal Languages. Academic Press, New York, NY, 1973."},{"key":"1_CR22","volume-title":"Theory of Computation","author":"D. Wood","year":"1987","unstructured":"D. Wood. Theory of Computation. John Wiley & Sons, Inc., New York, NY, 1987."},{"key":"1_CR23","volume-title":"Theory of Computation","author":"D. Wood","year":"1998","unstructured":"D. Wood. Theory of Computation. JohnWiley & Sons, Inc., New York, NY, second edition, 1998. In preparation.","edition":"second edition"},{"key":"1_CR24","volume-title":"On the Complexity of Grammar and Language Problems","author":"A. Yehudai","year":"1977","unstructured":"A. Yehudai. On the Complexity of Grammar and Language Problems. PhD thesis, University of California, Berkeley, CA, 1977."},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0304-3975(96)00028-X","volume":"163","author":"D. Ziadi","year":"1996","unstructured":"D. Ziadi. Regular expression for a language without empty word. Theoretical Computer Science, 163:309\u2013315, 1996.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48057-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T06:35:46Z","timestamp":1550385346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48057-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666523","9783540480570"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-48057-9_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}