Skip to main content
SpringerLink
Log in

Relational models of information-recognition problems, algorithms, and systems

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

Abstract

Relational models of information-recognition problems, algorithms, and systems are introduced and studied successively. Constructions are given for relation algebras, which describe the solution of information-recognition problems.

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

References

  1. Yu. I. Zhuravlev, “Correct algebras over sets of incorrect (heuristic) algorithms I, II, III,” Kibernetika, No. 4, 14–21 (1977).

    Google Scholar 

  2. Yu. I. Zhuravlev, “An algebraic approach to recognition problems,” Probl. Kibernetiki, No. 33, 5–68 (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center of the Academy of Sciences of the USSR, USSR

    A. I. Kondrat'ev

Authors
  1. A. I. Kondrat'ev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Dinamicheskie Sistemy, No. 7, pp. 132–140, 1988.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kondrat'ev, A.I. Relational models of information-recognition problems, algorithms, and systems. J Math Sci 65, 1592–1597 (1993). https://doi.org/10.1007/BF01097670

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation