Advertisement

Generalized probabilistic grammars

  • V. N. Agafonov
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Keywords

Finite Automaton Input String Derivation Tree Deterministic Automaton Probabilistic Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agafonov, V.N. On the notion of probabilistic grammar. 2-nd All-Union Symposium on Probabilistic Automata. Tbilisi, 1976, 3–5(in Russian).Google Scholar
  2. 2.
    Aho, A.V., Ullman, J.D. The theory of parsing, translation and compliling, vol. 1, Prentice-Hall, Inc., Englewood Cliffs, N.Y., 1972.Google Scholar
  3. 3.
    Booth, T.L. Probability representation of formal languages. 10-th Annual IEEE Symposium on Switching and Automata Theory, 1969.Google Scholar
  4. 4.
    Huang, T., Fu, K.S. On stochastic context-free languages. Information Sciences, 3 (1971), No 3.Google Scholar
  5. 5.
    Hutchins, S.E. Data compression in context-free languages. Information Processing 71 (IFIP Congress), vol. 1, 104–109.Google Scholar
  6. 6.
    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).Google Scholar
  7. 7.
    Salomaa, A. Probabilistic and weighted grammars. Information and Control, 15 (1969), No 6, 529–544.CrossRefGoogle Scholar
  8. 8.
    Santos, E.S. Probabilistic grammars and automata. Information and Control 21 (1972), No. 1, 27–47.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • V. N. Agafonov
    • 1
  1. 1.Institute of MathematicsNovosibirsk 90USSR

Personalised recommendations