{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:40Z","timestamp":1760202700177},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319299990"},{"type":"electronic","value":"9783319300009"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30000-9_27","type":"book-chapter","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T21:45:50Z","timestamp":1456436750000},"page":"345-358","source":"Crossref","is-referenced-by-count":1,"title":["The Missing Case in Chomsky-Sch\u00fctzenberger Theorem"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Crespi Reghizzi","sequence":"first","affiliation":[]},{"given":"Pierluigi","family":"San Pietro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N Chomsky","year":"1963","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.: The algebraic theory of context-free languages. In: Brafford, H. (ed.) Computer Programming and Formal Systems, pp. 118\u2013161. North-Holland, Amsterdam (1963)"},{"issue":"8","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1142\/S0129054112400710","volume":"23","author":"S Crespi Reghizzi","year":"2012","unstructured":"Crespi Reghizzi, S., San Pietro, P.: From regular to strictly locally testable languages. Int. J. Found. Comput. Sci. 23(8), 1711\u20131728 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6","key":"27_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0020-0190(92)90101-Z","volume":"44","author":"J Engelfriet","year":"1992","unstructured":"Engelfriet, J.: An elementary proof of double Greibach normal form. Inf. Process. Lett. 44(6), 291\u2013293 (1992)","journal-title":"Inf. Process. Lett."},{"key":"27_CR5","volume-title":"The Mathematical Theory of Context-free Languages","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S.: The Mathematical Theory of Context-free Languages. McGraw-Hill, New York (1966)"},{"key":"27_CR6","volume-title":"Introduction to Formal Language Theory","author":"M Harrison","year":"1978","unstructured":"Harrison, M.: Introduction to Formal Language Theory. Addison Wesley, Reading (1978)"},{"key":"27_CR7","volume-title":"Counter-free Automata","author":"R McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-free Automata. MIT Press, Cambridge (1971)"},{"key":"27_CR8","unstructured":"Medvedev, Y.T.: On the class of events representable in a finite automaton. In: Moore, E.F. (ed.) Sequential machines - Selected papers (translated from Russian), pp. 215\u2013227. Addison-Wesley, New York, NY, USA (1964)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-31653-1_12","volume-title":"Developments in Language Theory","author":"A Okhotin","year":"2012","unstructured":"Okhotin, A.: Non-erasing variants of the Chomsky\u2013Sch\u00fctzenberger theorem. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 121\u2013129. Springer, Heidelberg (2012)"},{"key":"27_CR10","volume-title":"Automata, Languages, and Machines","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press, Orlando (1974)"},{"issue":"1","key":"27_CR11","first-page":"276","volume":"76","author":"RJ Stanley","year":"1965","unstructured":"Stanley, R.J.: Finite state representations of context-free languages. M.I.T. Res. Lab. Electron. Quart. Progr. Rept. 76(1), 276\u2013279 (1965)","journal-title":"M.I.T. Res. Lab. Electron. Quart. Progr. Rept."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30000-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:56:14Z","timestamp":1559404574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30000-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319299990","9783319300009"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30000-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}