Skip to main content
SpringerLink
Log in

Probabilistic tree automata and context free languages

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

A notion of a probabilistic tree automaton is defined and a condition is given under which it is equivalent to a usual tree automaton. A theorem about context free languages is stated.

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. J. W. Thatcher and Wright,Generalized finite automata theory, Math. Systems Theory2 (1968) 57–82.

    Article  MathSciNet  Google Scholar 

  2. M. O. Rabin and D. Scott,Finite automata and their decision problems, IBM. J. Res. Develop. (1959), 114–122.

  3. M. O. Rabin,Probabilistic automata, Information and Control6 (1963), 230–245.

    Article  Google Scholar 

  4. J. W. Thatcher,Characterizing Derivation Tress of Context Free Grammars Through a Generalization of Finite Automata Theory, J. Comput. System Sci.1 (1967), 317–322.

    MATH  MathSciNet  Google Scholar 

  5. Y. Bar-Hillel, M. Perles and E. Shamir,On formal properties of simple phrase structure grammars, Z. Phonetik, Sprachneiss. Kommunikat.14 (1961), 143–172.

    MATH  MathSciNet  Google Scholar 

  6. M. O. Rabin,Mathematical theory of automata, Proc. Sympos. Appl. Math., Vol. 19, Amer. Math. Soc., Providence, R.I., 1968, pp. 153–175.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, The Hebrew University of Jerusalem, Israel

    M. Magidor & G. Moran

Authors
  1. M. Magidor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Moran
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was partially supported by ONR, Contract No. N00014 69 C 0192.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Magidor, M., Moran, G. Probabilistic tree automata and context free languages. Israel J. Math. 8, 340–348 (1970). https://doi.org/10.1007/BF02798680

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation