Skip to main content
SpringerLink
Log in

On the Depth of k-Valued Logic Functions Over Arbitrary Bases

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

The behavior of the Shannon function of the depth of k-valued logic functions realized by circuits over an arbitrary complete basis is examined. For all k, k ≥ 3, for an arbitrary basis of k-valued logic functions, the existence of the asymptotic behavior of the Shannon function of the depth is established. The asymptotic behavior is linear for finite bases and it is constant or logarithmic for infinite bases. Thus, the complete picture of asymptotic behavior of the Shannon function of the depth is obtained for all k, k ≥ 2.

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. S. B. Gashkov, “On the depth of Boolean functions,” Probl. Kibernet., No. 34, 265–268 (1978).

  2. O. M. Kasim-Zade, “The depth of Boolean functions realized by circuits over an arbitrary basis,” Moscow Univ. Math. Bull., 62, No. 1, 18–21 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  3. O. M. Kasim-Zade, “Depth of Boolean functions over an arbitrary infinite basis,” J. Appl. Indust. Math., 2, No. 2, 196–210 (2008).

    Article  MathSciNet  Google Scholar 

  4. O. M. Kasim-Zade, “Depth of Boolean functions realized by circuits over an arbitrary infinite basis,” Moscow Univ. Math. Bull., 68, No. 1, 69–70 (2013).

    Article  MATH  Google Scholar 

  5. A. V. Kochergin, “Depth of functions of k-valued logic in finite bases,” Moscow Univ. Math. Bull., 68, No. 1, 77–79 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  6. A. V. Kochergin, “On the depth of multivalued logic functions realized by circuits over an arbitrary infinite basis,” in: Materials of IX Youth Scientific School on Discrete Mathematics and Its Applications, Moscow, Russia, September 16–21, 2013 [in Russian], Izd. Inst. Prikl. Mekh. im. M. V. Keldysha, Moscow (2013), pp. 61–66.

  7. S. A. Lozhkin, “On the depth of functions of propositional calculus in some bases,” Ann. Univ. Sci. Budapest. Sec. Comput, 4, 113–125 (1983).

    MathSciNet  MATH  Google Scholar 

  8. S. A. Lozhkin, “On the depth of Boolean functions in an arbitrary complete basis,” Moscow Univ. Math. Bull., 51, No. 2, 57–63 (1996).

    MathSciNet  Google Scholar 

  9. O. B. Lupanov, “Circuits of functional elements with delay,” Probl. Kibernet., No. 23, 43–81 (1970).

  10. O. B. Lupanov, Asymptotic Bounds to the Complexity of Control Systems [in Russian], Izd. Mosk. Univ., Moscow (1984).

  11. J. E. Savage, The Complexity of Computing, Wiley–Interscience, New York (1976).

Download references

Author information

Authors and Affiliations

  1. Keldysh Institute of Applied Mathematics (Russian Academy of Sciences), Moscow, Russia

    A. V. Kochergin

Authors
  1. A. V. Kochergin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Kochergin.

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 20, No. 6, pp. 155–158, 2015.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kochergin, A.V. On the Depth of k-Valued Logic Functions Over Arbitrary Bases. J Math Sci 233, 100–102 (2018). https://doi.org/10.1007/s10958-018-3927-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-018-3927-5

Search

Navigation