Skip to main content
SpringerLink
Log in

Frequency computations in finite automata

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. R. McNaughton, “The theory of automata, a survey,” Advances in Computers, Vol. 2 (1961).

  2. B. A. Trakhtenbrot, “On frequency computations of functions,” in: Algebra and Logic [in Russian], Vol. 2, No. 1, Novosibirsk (1963).

  3. M. O. Rabin, “Probabilistic automata,” Inform. Control, No. 4 (1962).

  4. B. A. Trakhtenbrot and Ya. M. Barzdin', Finite Automata [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  5. I. N. Kovalenko, “A note on the complexity of representing events in probabilistic and deterministic automata,” Kibernetika, No. 2 (1965).

  6. E. B. Kinber, “Frequency computations of generally recursive predicates and frequency computations of sets,” Dokl. Akad. Nauk SSSR,205, No. 1 (1972).

    Google Scholar 

Download references

Authors
  1. E. B. Kinber
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 7–15, March–April, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kinber, E.B. Frequency computations in finite automata. Cybern Syst Anal 12, 179–187 (1976). https://doi.org/10.1007/BF01069884

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation