Skip to main content
SpringerLink
Log in

Stochastic grammars and languages

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

This paper summarizes some recent results concerned with the extension of formal languages to their corresponding stochastic versions. Weighted grammars and languages are first defined, and stochastic grammars and languages are defined as a special case of weighted grammars and languages. Fuzzy grammars and languages, which have some properties similar to weighted grammars and languages, are also discussed. Stochastic automata are defined from the language recognition viewpoint. Languages accepted by stochastic finite-state and pushdown automata, with and without a cutpoint, are studied. Weighted and stochastic programmed and indexed grammars, and stochastic nested stack automata are defined. Finally, some decidability problems of stochastic (weighted, fuzzy) languages are discussed, and problems for further research are suggested.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Aho, “Indexed grammars—An extension of context-free grammars,”J. ACM 15:647–671 (1968).

    Google Scholar 

  2. A. V. Aho, “Nested stack automata,”J. ACM 16:383–406 (1969).

    Google Scholar 

  3. A. V. Aho and J. D. Ullman, “The theory of languages,”Mathematical Systems Theory 2:97–125 (1967).

    Google Scholar 

  4. R. B. Banerji, “Phrase structure languages, finite machines, and channel capacity,”Information and Control 6:153–162 (1963).

    Google Scholar 

  5. T. L. Booth, “Probability representation of formal languages,” inIEEE Tenth Annual Symposium on Switching and Automata Theory (1969).

  6. G. D. Bruce and K. S. Fu, “A model for finite-state probabilistic systems,” inProc. of the First Allerton Conference on Circuit and System Theory, University of Illinois (1962).

  7. N. Chomsky and C. A. Miller, “Finite state language,”Information and Control 1:91–112 (1958).

    Google Scholar 

  8. N. Chomsky, “On certain formal properties of grammars,”Information and Control 2:137–167 (1959).

    Google Scholar 

  9. N. Chomsky, “Context-free grammars and pushdown storage,” Quarterly Progress Report No. 65, Research Laboratory of Electronics, Massachusetts Institute of Technology, pp. 187–194 (1962).

  10. C. A. Ellis, “Probabilistic languages and automata,” Report No. 355, Department of Computer Science, University of Illinois (1969).

  11. J. Evey, “The theory and application of pushdown machines,” Doctoral Thesis, Harvard University (1963).

  12. K. S. Fu, “On syntactic pattern recognition and stochastic languages” inProc. International Conference on Frontiers of Pattern Recognition, Honolulu, Hawaii, 1971.

  13. K. S. Fu and T. Li, “On stochastic automata and languages,”Information Sciences 1:403–419 (1969).

    Google Scholar 

  14. K. S. Fu and P. H. Swain, “On syntactic pattern recognition,” inProc. of the Third International Symposium on Computer and Information Science, Bal Harbour, Florida; also published inSoftware Engineering, Vol. II, ed. by J. T. Tou (Academic Press, New York, 1971).

  15. S. Ginsburg and S. A. Greibach, “Deterministic context-free languages,”Information and Control 9:620–648 (1966).

    Google Scholar 

  16. S. A. Greibach, “A new normal form theorem for context-free phrase structure grammars,”J. ACM 12:42–52 (1965).

    Google Scholar 

  17. U. Grenander, “Syntax-controlled probabilities,” Technical Report, Division of Applied Mathematics, Brown University (1967).

  18. T. E. Harris,The Theory of Branching Processes (Springer-Verlag, Berlin, 1963).

    Google Scholar 

  19. J. E. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata (Addison-Wesley, Reading, Mass., 1969).

    Google Scholar 

  20. T. Huang and K. S. Fu, “On stochastic context-free languages,”Information Sciences 3 (no. 3) (1971).

  21. T. Huang and K. S. Fu, “Stochastic languages and their applications to pattern recognition,” Technical Report, Purdue University (1971).

  22. S. E. Hutchins, “Stochastic sources for context-free languages,” Ph.D. Thesis, Department of Applied Physics and Information Science, University of California, San Diego (1970).

    Google Scholar 

  23. M. M. Kherts, “Entropy of languages generated by automata or context-free grammars with a single-valued deduction,”Naucho-Tekhn. Inf. Ser. 2–1 (1968).

  24. E. T. Lee and L. A. Zadeh, “Note on fuzzy languages,”Information Sciences 1:421–434 (1969).

    Google Scholar 

  25. M. Magidor and G. Moran, “Probabilistic tree automata and constext-free languages,”Israel. J. Math. 8:340–348 (1970).

    Google Scholar 

  26. M. Mizumoto, “Fuzzy automata and fuzzy grammars,” Ph.D. Thesis, Faculty of Engineering Sciences, Osaka University (1971).

  27. M. Mizumoto, J. Toyoda, and K. Tanaka, “Some considerations on fuzzy automata,”J. Computer and System Sci. 3:409–422 (1969).

    Google Scholar 

  28. M. Nasu and N. Honda, “Fuzzy events realized by probabilistic automata,”Information and Control 12:284–303 (1966).

    Google Scholar 

  29. M. Nasu and N. Honda, “A context-free language which is not acceptable by a probabilistic automaton,”Information and Control 18:233–236 (1971).

    Google Scholar 

  30. A. Paz, “Some aspects of probabilistic automata,”Information and Control 9:26–60 (1966).

    Google Scholar 

  31. M. O. Rabin, “Probabilistic automata,”Information and Control 6:230–245 (1963).

    Google Scholar 

  32. M. O. Rabin and D. Scott, “Finite automata and their decision problems,”IBM J. Res. Develop. 3:114–125 (1959).

    Google Scholar 

  33. D. J. Rosenkrantz, “Programmed grammars—A new device for generating formal languages,”J. ACM 10:107–131 (1969).

    Google Scholar 

  34. A. Salomaa, “Onm-adic probabilistic automata,”Information and Control 10:215–219 (1967).

    Google Scholar 

  35. A. Salomaa, “On languages accepted by probabilistic and time-variant automata,” inProc. of the Second Annual Princeton Conference on Information Sciences and Systems, 1968, pp. 184–188.

  36. A. Salomaa, “Probabilistic and weighted grammars,”Information and Control 15:529–544 (1969).

    Google Scholar 

  37. E. S. Santos, “Maximin automata,”Information and Control 13:363–377 (1968).

    Google Scholar 

  38. C. R. Souza, “Probabilities in context-free programmed grammars,” TR-A70-2, The Aloha System, University of Hawaii, Honolulu, Hawaii, 1970.

    Google Scholar 

  39. M. P. Schutzenberger, “On context-free languages and pushdown automata,”Information and Control 3:246–264 (1963).

    Google Scholar 

  40. P. H. Swain and K. S. Fu, “Stochastic programmed grammars for syntactic pattern recognition,”Pattern Recognition (Special Issue on Syntactic Pattern Recognition 3(3) (1971).

  41. J. W. Thatcher and J. B. Wright, “Generalized automata theory,”Mathematical Systems Theory 2:57–82 (1968).

    Google Scholar 

  42. P. Turakainen, “On stochastic languages,”Information and Control 12:304–313 (1968).

    Google Scholar 

  43. P. Turakainen, “Some closure properties of the family of stochastic languages,”Information and Control 18:253–256 (1971).

    Google Scholar 

  44. W. G. Wee and K. S. Fu, “A formulation of fuzzy automata and its application as a model of learning systems,”IEEE Trans. Systems Science and Cybernetics SSC-5: 215–223 (1969).

    Google Scholar 

  45. L. A. Zadeh, “Fuzzy set,”Information and Control 8:338–353 (1965).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering, Purdue University, Lafayette, Indiana

    K. S. Fu & T. Huang

Authors
  1. K. S. Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the National Science Foundation Grant GK-18225.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu, K.S., Huang, T. Stochastic grammars and languages. International Journal of Computer and Information Sciences 1, 135–170 (1972). https://doi.org/10.1007/BF00995736

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00995736

Keywords

Search

Navigation