Skip to main content
SpringerLink
Log in

Certain special cases of the problem of stopping and functional equivalence of 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. V. M. Glushkov, “The theory of automata and formal transformation of microprograms,” Kibernetika, No. 5, Kiev (1965).

  2. A. A. Letichevskii, “Functional equivalence of discrete transformers,” Parts 1 and 2, Kibernetika, No. 2, Kiev (1969); No. 2 (1970).

  3. B. A. Trakhtenbrot, Complexity of Algorithms and Computations [in Russian], Izd. Novosibirskogo Gosuniversiteta (1967).

    Google Scholar 

Download references

Authors
  1. A. B. Godlevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 90–97, July–August, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Godlevskii, A.B. Certain special cases of the problem of stopping and functional equivalence of automata. Cybern Syst Anal 9, 644–652 (1973). https://doi.org/10.1007/BF01068589

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation