Skip to main content
SpringerLink
Log in

Some properties of two-dimensional iterative systems

  • Published:
Cybernetics Aims and scope

Conclusion 2.1

No finite algorithm exists which determines whether a random two-dimensional autonomous regular iterative system can be separated.

The proof of this fact is a literal repetition of the proof of Conclusion 17.1 in [1].

In conclusion the author would like to thank M. I. Kratko for the formulation of the problem.

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

Similar content being viewed by others

Literature Cited

  1. F. C. Hennie, III, Iterative Arrays of Logical Circuits, Massachusettes Institute of Technology Press (1961).

  2. V. M. Glushkov, Synthesis of Digital Automatic Machines [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

  3. O. M. Revin, Classes of Matrices determined using Regular Iterative Systems [in Russian], Preprint 73-8, Izd. Inst. Kibernetika, Akad. Nauk UkrSSR, Kiev (1973).

    Google Scholar 

Download references

Authors
  1. O. M. Revin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 39–45, May–June, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Revin, O.M. Some properties of two-dimensional iterative systems. Cybern Syst Anal 10, 419–426 (1974). https://doi.org/10.1007/BF01068709

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation