Skip to main content
SpringerLink
Log in

Finite state expressions in a system of algorithmic algebras with a commutative algebra of conditions

  • 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, “Automata theory and formal transformations of microprograms,” Kibernetika, No. 5 (1965).

  2. P. M. Ivanov, “Automata-regular microprograms,” Kibernetika, No. 1 (1973).

  3. V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

  4. P. M. Ivanov, “Equivalent transformations in microprogram algebras,” in: Theoretical Cybernetics [in Russian], Vol. 3, Inst. Kibernetika Akad. Nauk UkrSSR, Kiev (1970).

    Google Scholar 

Download references

Authors
  1. P. M. Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 16–20, March–April, 1978

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ivanov, P.M. Finite state expressions in a system of algorithmic algebras with a commutative algebra of conditions. Cybern Syst Anal 14, 170–174 (1978). https://doi.org/10.1007/BF01069346

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation