Preview
Unable to display preview. Download preview PDF.
References
Agafonov, V.N. On the notion of probabilistic grammar. 2-nd All-Union Symposium on Probabilistic Automata. Tbilisi, 1976, 3–5(in Russian).
Aho, A.V., Ullman, J.D. The theory of parsing, translation and compliling, vol. 1, Prentice-Hall, Inc., Englewood Cliffs, N.Y., 1972.
Booth, T.L. Probability representation of formal languages. 10-th Annual IEEE Symposium on Switching and Automata Theory, 1969.
Huang, T., Fu, K.S. On stochastic context-free languages. Information Sciences, 3 (1971), No 3.
Hutchins, S.E. Data compression in context-free languages. Information Processing 71 (IFIP Congress), vol. 1, 104–109.
Khertz, M.M. Entropy of languages generated by unambiguous finite-state or context-free grammars. Naučno-tehničeskaja informazija, (1968) NI, 29–34(in Russian).
Salomaa, A. Probabilistic and weighted grammars. Information and Control, 15 (1969), No 6, 529–544.
Santos, E.S. Probabilistic grammars and automata. Information and Control 21 (1972), No. 1, 27–47.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agafonov, V.N. (1977). Generalized probabilistic grammars. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_138
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_138
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive