Skip to main content
SpringerLink
Log in

Generalized information-lossless automata. I

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis 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

References

  1. D. A. Huffman, “Canonical forms for information-lossless finite-state logical machines,” IRE Trans. Circuit Theory,CT-6, Special Suppl., 41–59 (1959).

    MATH  Google Scholar 

  2. S. Even, “On information lossless automata of finite order,” IEEE Trans. Electr. Comput.,C-14, No. 4, 561–569 (1965).

    MATH  Google Scholar 

  3. D. V. Speranskii, “Essentially information-lossless automata,” Avtomat. Telemekh., No. 10, 181–184 (1971).

    MATH  MathSciNet  Google Scholar 

  4. D. V. Speranskii, “Essentially information-lossless automata of finite order,” Avtomat. Telemekh., No. 6, 90–95 (1972).

    MATH  MathSciNet  Google Scholar 

  5. A. Gill, An Introduction to the Theory of Finite Automata [Russian translation], Nauka, Moscow (1966).

    Google Scholar 

Download references

Authors
  1. D. V. Speranskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 63–69, May–June, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Speranskii, D.V. Generalized information-lossless automata. I. Cybern Syst Anal 30, 365–370 (1994). https://doi.org/10.1007/BF02366470

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation