{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:41:29Z","timestamp":1767138089922,"version":"build-2238731810"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540068419","type":"print"},{"value":"9783662215456","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1974]]},"DOI":"10.1007\/978-3-662-21545-6_28","type":"book-chapter","created":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T05:10:34Z","timestamp":1386393034000},"page":"364-382","source":"Crossref","is-referenced-by-count":4,"title":["Context-Free Grammar Forms"],"prefix":"10.1007","author":[{"given":"Armin B.","family":"Cremers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seymour","family":"Ginsburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","volume":"2","author":"N Chomsky","year":"1959","unstructured":"Chomsky, N., On certain formal properties of grammars, Infor. and Control 2 (1959) 137\u2013167.","journal-title":"Infor. and Control"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems, P.Braffort and D. Hirschberg (eds)","author":"N Chomsky","year":"1963","unstructured":"Chomsky, N., M.P. Schutzenberger, The algebraic theory of context-free languages, in Computer Programming and Formal Systems, P.Braffort and D. Hirschberg (eds), 118\u2013161, North-Holland Publishing Co., Amsterdam (1963)."},{"key":"28_CR3","unstructured":"Gabrielian,A., S.Ginsburg, Grammar schemata, to appear in the J.ACM."},{"key":"28_CR4","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":"28_CR5","unstructured":"Ginsburg, S., Algebraic and Automata-Theoretic Properties of Formal Languages, to be published by the North-Holland Publishing Co., Amsterdam."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/0304034","volume":"4","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., E.H. Spanier, Finite-Turn pushdown automata, SIAM J. on Cont. 4 (1966), 429\u2013453.","journal-title":"SIAM J. on Cont."},{"key":"28_CR7","first-page":"228","volume":"5","author":"S Ginsburg","year":"1968","unstructured":"Ginsburg, S., E.H. Spanier, Derivation-bounded languages, J.CSS 5 (1968) 228\u2013250.","journal-title":"J.CSS"},{"key":"28_CR8","unstructured":"Ginsburg, S, E.H. Spanier, private communication."},{"key":"28_CR9","first-page":"30","volume":"6","author":"SA Greibach","year":"1972","unstructured":"Greibach, S.A., Simple syntactic operators on full semi-AFL`s, J.CSS 6 (1972) 30\u201376.","journal-title":"J.CSS"},{"key":"28_CR10","first-page":"33","volume":"87","author":"SA Greibach","year":"1969","unstructured":"Greibach, S.A., J.E. Hoperoft, Independence of AFL operations, in Studies in Abstract Families of Languages, Memoirs of the Amer.Math.Soc. 87 (1969) 33\u201344.","journal-title":"Memoirs of the Amer.Math.Soc."},{"key":"28_CR11","volume-title":"Theoretische Grundlagen der Programmiersprachen","author":"H Maurer","year":"1969","unstructured":"Maurer, H., Theoretische Grundlagen der Programmiersprachen, Bibliographisches Institut, Mannheim (1969)."},{"key":"28_CR12","volume-title":"Transductions des Languages de Chomsky, Ph.D","author":"M Nivat","year":"1967","unstructured":"Nivat, M., Transductions des Languages de Chomsky, Ph.D. Thesis, Paris 1967."},{"key":"28_CR13","first-page":"474","volume":"10","author":"A Salomaa","year":"1979","unstructured":"Salomaa, A., On the index of context-free grammars and languages, Information and Control, 10 (1979) 474\u2013477.","journal-title":"Information and Control"},{"key":"28_CR14","first-page":"276","volume":"76","author":"RJ Stanley","year":"1965","unstructured":"Stanley, R. J., Finite state representations of context-free languages, MIT Research Laboratory Quarterly Progress Report, 76 (1965) 276\u2013279.","journal-title":"MIT Research Laboratory Quarterly Progress Report"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/S0019-9958(67)91032-7","volume":"10","author":"MK Yntema","year":"1967","unstructured":"Yntema, M. K., Inclusion relations among families of context-free languages, Information and Control, 10 (1967) 572\u2013597.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-21545-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T08:56:49Z","timestamp":1561971409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-21545-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974]]},"ISBN":["9783540068419","9783662215456"],"references-count":15,"aliases":["10.1007\/3-540-06841-4_75"],"URL":"https:\/\/doi.org\/10.1007\/978-3-662-21545-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974]]}}}