Skip to main content
SpringerLink
Log in

Algebraic characterization of the computing power 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

Refrenes

  1. K. B. Krohn and J. L. Rhodes, “Algebraic theory of machines,” Proc. Sympos. Math. Theory Autom., New York, N. Y., 1962; Brooklyn Polytech Inst. Press, 341–384, 1963.

  2. E. S. Lyapin, Semigroups [in Russian], Fizmatgiz, Moscow, 1960.

    Google Scholar 

  3. G. Riguet, “Binary relations, inclusions, Galois relations [Russian translation], In: Kiberneticheskii sbornik, vol. 7, IL, 1963.

Download references

Authors
  1. M. A. Spivak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 1, No. 4, pp. 1–11, 1965

Rights and permissions

Reprints and permissions

About this article

Cite this article

Spivak, M.A. Algebraic characterization of the computing power of automata. Cybern Syst Anal 1, 1–14 (1965). https://doi.org/10.1007/BF01071248

Download citation

  • Issue Date:

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

Keywords

Search

Navigation