Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnaya Matematika, 1996, Volume 8, Issue 4, Pages 123–133
DOI: https://doi.org/10.4213/dm545
(Mi dm545)
 

Automaton complexity of two-place Boolean bases

A. E. Andreev, A. A. Chasovskikh
Abstract: The problem on the minimal possible number of states for an automaton computing values of Boolean expressions of the given length over different operator bases is considered. It is established that the set of all the bases falls into three classes depending on whether the growth of logarithm of the necessary number of states is constant, logarithmic or linear. The criteria system of five bases classified in the stated sense is obtained and the determination of the class of any given set of operations is performed by checking its inclusion into the bases of the criteria system. This allows us to carry out the complete classification of bases of operations from the considered point of view. The proofs of the results are given.
This work was supported by the Russian Foundation for Basic Research, grant 95–01–00707.
Received: 23.10.1996
Bibliographic databases:
UDC: 519.4
Language: Russian
Citation: A. E. Andreev, A. A. Chasovskikh, “Automaton complexity of two-place Boolean bases”, Diskr. Mat., 8:4 (1996), 123–133; Discrete Math. Appl., 6:6 (1996), 599–610
Citation in format AMSBIB
\Bibitem{AndCha96}
\by A.~E.~Andreev, A.~A.~Chasovskikh
\paper Automaton complexity of two-place Boolean bases
\jour Diskr. Mat.
\yr 1996
\vol 8
\issue 4
\pages 123--133
\mathnet{http://mi.mathnet.ru/dm545}
\crossref{https://doi.org/10.4213/dm545}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1447326}
\zmath{https://zbmath.org/?q=an:0862.68082}
\transl
\jour Discrete Math. Appl.
\yr 1996
\vol 6
\issue 6
\pages 599--610
Linking options:
  • https://www.mathnet.ru/eng/dm545
  • https://doi.org/10.4213/dm545
  • https://www.mathnet.ru/eng/dm/v8/i4/p123
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:432
    Full-text PDF :227
    First page:3
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024