Skip to main content
SpringerLink
Log in

A method for simplifying the disjunctive normal form (DNF) of boolean functions

  • 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

References

  1. Yu. I. Zhuravlev, “Set-theoretic methods in logical algebra,” collection: Problems of Cybernetics, no. 8, Moscow, 1962.

  2. F. I. Andon, “An algorithm for simplifying the dnf's of boolean functions,” Kibernetika [Cyhernetics], no. 6, k., 1966.

  3. V. S. Mikhalevich and N. Z. Shor, “Numerical solution of multivariant problems by successive analysis of variants,” Papers on Scientific Methods in the Mathematical Economics Seminar, LEMM AN SSSR [in Russian], no. 1, Moscow, 1962.

Download references

Authors
  1. F. I. Andon
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 3, No. 1, pp. 21–25, 1966

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andon, F.I. A method for simplifying the disjunctive normal form (DNF) of boolean functions. Cybern Syst Anal 3, 17–20 (1967). https://doi.org/10.1007/BF01072840

Download citation

  • Issue Date:

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

Keywords

Search

Navigation