Skip to main content
Springer Nature Link
Log in

Finite stochastic automata with variable transition probabilities

Begrenzte stochastische Automaten mit veränderlichen Übergangswahrscheinlichkeiten

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The transition probabilities of the stochastic automata we introduce in this paper are dependent upon the number of times the current state has been passed by. All the possible ways an automaton can develop, are represented by a set of matrices, which is formally characterized.

Based on this representation, a method to calculate some probabilities of these automata, is given.

Zusammenfassung

Die Übergangswahrscheinlichkeiten der stochastischen Automaten, die wir in diesen Beitrag einführen, hängen davon ab, wie oft man durch den derzeitigen Zustand läuft. Alle möglichen Weisen auf denen die Automaten sich entwickeln können, sind vorgestellt worden durch eine Ansammlung Matrizen, die auf formelle Weise charakterisiert worden sind.

Begründet auf dieser Vorstellung wird eine Methode gegeben, um einige Wahrscheinlichkeiten dieser Automaten auszurechnen.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Arbib, M. A.: Theories of Abstract Automata. Prentice-Hall. 1969.

  2. Baer, J., D. Bovet, andG. Estrin: Legality and Other Properties of Graph Models of Computations. J.A.C.M.17, 543–554 (1970).

    Google Scholar 

  3. Karp, R.: A note on the application of graph theory to digital computer programming. Information and Control3, 179–190 (1960).

    Article  Google Scholar 

  4. Martin, D., andG. Estrin: Path length computations on graph models of computations. IEEE Trans. EC-181969, 530–536.

  5. Martin, D., andG. Estrin: Models of Computations and Systems-Evaluation of Vertex Probabilities in Graph Models of Computations. J.A.C.M.14, 281–299 (1967).

    Google Scholar 

  6. Paz, A.: Introduction to probabilistic automata. New York-London: Academic Press 1971.

    Google Scholar 

  7. Tou, J.: Applied Automata Theory. Academic Press. 1968.

Download references

Author information

Author notes

  1. J. J. Paredaens (Aspirant)

    Present address: Computing Centre V.U.B. Brussels, Nationaal fonds van Wetenschappelijk Onderzoek, Brussels, Belgium

Authors and Affiliations

  1. Rekencentrum V.U.B./U.L.B., Vrije Universiteit Brussel, Adolphe Buyllaan 91, B-1050, Brussels, Belgium

    J. J. Paredaens (Aspirant)

Authors
  1. J. J. Paredaens
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

With 2 Figures

Rights and permissions

Reprints and permissions

About this article

Cite this article

Paredaens, J.J. Finite stochastic automata with variable transition probabilities. Computing 11, 1–20 (1973). https://doi.org/10.1007/BF02239466

Download citation

  • Received:

  • Issue Date:

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

Keywords