Skip to main content
SpringerLink
Log in

Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

The realization complexity of Boolean functions associated with finite grammars in the class of formulas of alternation depth 3 is studied. High accuracy asymptotic bounds are obtained for the corresponding Shannon function.

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. O. B. Lupanov, Asymptotic Estimates of Complexity of Control Systems (Moscow State Univ., Moscow, 1984) [in Russian].

    Google Scholar 

  2. S. A. Lozhkin, “High Accuracy Estimates for the Complexity of Control Systems from Certain Classes,” in: Mathematical Problems of Cybernetics, Issue 6 (Fizmatlit, Moscow, 1961), pp.189–213.

    Google Scholar 

  3. O. B. Lupanov, “Realization of Boolean Functions by Formulas from Finite Classes (Formulas of Bounded Depth) in the Basis &, ∨, −,” in: Problems of Cybernetics, Issue 6 (Fizmatlit, Moscow, 1961), pp. 5–14.

    Google Scholar 

  4. S. A. Lozhkin and V. A. Konovodov, “Synthesis and Complexity of Formulas with Bounded Alternation Depth,” Vestn. Mosk. Univ., Matem. Mekhan, No. 3, 28 (2012).

    Google Scholar 

  5. S. A. Lozhkin, “Asymptotic Estimates of High Accuracy for Complexity of Functions Related to Automata Languages,” in: Problems of Theoretical Cybernetics. Proc. XII Int. Conf. Part II. Ed. by O. B. Lupanov (Moscow State Univ, Mech. Math. Dept., Moscow, 1999), p. 138.

    Google Scholar 

  6. A. V. Kondratov, “Asymptotic Estimates of High Accuracy for Complexity of Realization of Functions Related to Automata Languages in Some Classes of Circuits,” in: Mathematical Problems of Cybernetics, Issue 13 (Fizmatlit, Moscow, 2004), pp. 279–288.

    Google Scholar 

  7. S. A. Lozhkin, Lectures in Foundations of Cybernetics (Moscow State Univ., CM&C Faculty, Moscow, 2004).

    Google Scholar 

  8. N. Chomsky and G. A. Miller, “Finite State Languages,” Inf. and Control 1, 91 (1958) [Kibern. Sborn. 4, 233 (1962)].

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computational Mathematics and Cybernetics, Moscow State University, Leninskie Gory, Moscow, 119991, Russia

    S. A. Lozhkin & V. A. Konovodov

Authors
  1. S. A. Lozhkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Konovodov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. A. Lozhkin.

Additional information

Original Russian Text © S.A. Lozhkin. V.A. Konovodov. 2014, published in Vestnik Moskovskogo Universiteta. Matematika. Mekhanika, 2014, Vol. 69, No. 3, pp. 14–19.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lozhkin, S.A., Konovodov, V.A. Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3. Moscow Univ. Math. Bull. 69, 100–105 (2014). https://doi.org/10.3103/S0027132214030036

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132214030036

Keywords

Search

Navigation