Skip to main content
SpringerLink
Log in

Mathematical methods of the theory of stochastic automata

  • Automata Theory
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science (MFCS 1974)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 28))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. RABIN Probabilistic Automata. Information and Control 6 (1963), 230–245.

    Google Scholar 

  2. TURAKAINEN Generalized Automata and Stochastic Languages Proc. Am. Math. Soc. 21 (1969), 303–309.

    Google Scholar 

  3. ZADEH Fuzzy Sets. Information and Control 8 (1965), 338–353

    Google Scholar 

  4. SALOMAA Probabilistic and weighted grammars. Information and Control 15 (1969), 529–544.

    Google Scholar 

  5. CHOMSKY, SCHUETZENBERGER The algebraic theory of context-free languages. Comp. Prog. and Formal Systems (1963).

    Google Scholar 

  6. BLIKLE, MAZURKIEWICZ An algebraic approach to theory of programs, algorithms, languages and recursiveness. Summer school on Math. Found. of Comp. sc. Warsaw — Jablonna (1972).

    Google Scholar 

  7. SHAMIR Algebraic, rational and context-free power series on noncommuting variables. Alg. Theory of Mach., Lang. and Semigroups Academic Press (1968)

    Google Scholar 

  8. GATTO, MANDRIOLI Equilavenza tra grammatiche, sistemi di equazioni in variabili di serie formali. Convegno AICA, Pisa, 1–3 Marzo 1973.

    Google Scholar 

  9. BERTONI Equations of formal power series over non commutative semirings. Proc. of Symp. MFCS — High Tatras (1973) 185–190.

    Google Scholar 

  10. STANAT A homomorphism theorem for weighted context-free grammars. Jour. Comp. Syst. Science (1972).

    Google Scholar 

  11. FRECHET Recherches theoretiques modernes sur le calcul des probabilités. Gauthiers-Villars, Paris (1938).

    Google Scholar 

  12. SCHUETZENBERGER On definition of a family of Automata. Information and Control 4 (1961) 245–270.

    Google Scholar 

  13. CARLYLE-PAZ Realization by stochastic finite automata (1972).

    Google Scholar 

  14. FLIESS Automates Stochastiques Automata, Lang. and Programming (1972).

    Google Scholar 

  15. NASU-HONDA Context-free but not stochastic language Information and Control 18 (1971) 233–236.

    Google Scholar 

  16. COBHAM Uniform tag sequences. Math. Syst. Theory (1972) 164–192.

    Google Scholar 

  17. BERSTEL Sur la densité asympotique des languages formels Automata, languages and programming, North Holland (1972) 345–358.

    Google Scholar 

  18. PAZ Introduction to probabilistic automata. Academic Press New York (1971).

    Google Scholar 

  19. POST A variant of a recursively unsolvable problem. Bull. Am. Math. Soc. 52 (1946) 264–268.

    Google Scholar 

  20. HOPCROFT, ULLMAN Formal languages and their relation to automata. Addison Wesley Publishing Co. (1969).

    Google Scholar 

  21. NASU, HONDA Mappings induced by PGSM mappings and some recursively unsolvable problems of finite probabilistic automata. Information and Control 15 (1969) 250–273.

    Google Scholar 

  22. PAZ Fuzzy star function J. Comp. System Science 1 (1967) 371–389.

    Google Scholar 

  23. BERTONI Grammatiche context-free su spazi metrici compatti. Calcolo 1 (1974) 155–170.

    Google Scholar 

  24. BERTONI Complexity problems related to the approximation of prob. languages by deterministic machines. Automata, lang. and programming, North Holland (1972), 507–516.

    Google Scholar 

  25. BERTONI The solution of problems relative to probabilistic automata in the frame of formal languages theory. To appear at the 4th Annual Meeting GI 74 Berlin

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gruppo Elettronica e Cibernetica Istituto di Fisica, Università di Milano, Via Viotti, 5, 20133, Milano, Italia

    A. Bertoni

Authors
  1. A. Bertoni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertoni, A. (1975). Mathematical methods of the theory of stochastic automata. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_662

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_662

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

  • Online ISBN: 978-3-540-37492-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation