{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:21Z","timestamp":1725663261477},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540083535"},{"type":"electronic","value":"9783540372851"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08353-7_138","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:23:41Z","timestamp":1330187021000},"page":"213-221","source":"Crossref","is-referenced-by-count":0,"title":["Generalized probabilistic grammars"],"prefix":"10.1007","author":[{"given":"V. N.","family":"Agafonov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"16_CR1","unstructured":"Agafonov, V.N. On the notion of probabilistic grammar. 2-nd All-Union Symposium on Probabilistic Automata. Tbilisi, 1976, 3\u20135(in Russian)."},{"key":"16_CR2","volume-title":"The theory of parsing, translation and compliling, vol. 1","author":"A. V. Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D. The theory of parsing, translation and compliling, vol. 1, Prentice-Hall, Inc., Englewood Cliffs, N.Y., 1972."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Booth, T.L. Probability representation of formal languages. 10-th Annual IEEE Symposium on Switching and Automata Theory, 1969.","DOI":"10.1109\/SWAT.1969.17"},{"key":"16_CR4","first-page":"3","volume":"3","author":"T. Huang","year":"1971","unstructured":"Huang, T., Fu, K.S. On stochastic context-free languages. Information Sciences, 3 (1971), No 3.","journal-title":"pe=\"Underline\">Information Sciences"},{"key":"16_CR5","unstructured":"Hutchins, S.E. Data compression in context-free languages. Information Processing 71 (IFIP Congress), vol. 1, 104\u2013109."},{"key":"16_CR6","unstructured":"Khertz, M.M. Entropy of languages generated by unambiguous finite-state or context-free grammars. Nau\u010dno-tehni\u010deskaja informazija, (1968) NI, 29\u201334(in Russian)."},{"issue":"No6","key":"16_CR7","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/S0019-9958(69)90554-3","volume":"15","author":"A. Salomaa","year":"1969","unstructured":"Salomaa, A. Probabilistic and weighted grammars. Information and Control, 15 (1969), No 6, 529\u2013544.","journal-title":"Information and Control"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0019-9958(72)90026-5","volume":"21","author":"E. S. Santos","year":"1972","unstructured":"Santos, E.S. Probabilistic grammars and automata. Information and Control 21 (1972), No. 1, 27\u201347.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1977"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08353-7_138.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:08Z","timestamp":1619556728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08353-7_138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540083535","9783540372851"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-08353-7_138","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}