Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Matematicheskie Zametki, 2020, Volume 107, Issue 4, Pages 591–603
DOI: https://doi.org/10.4213/mzm12374 (Mi mzm12374) 		 
This article is cited in 5 scientific papers (total in 5 papers)

Short Tests of Closures for Contact Circuits

K. A. Popkov

Keldysh Institute of Applied Mathematics of Russian Academy of Sciences, Moscow
Full-text PDF (521 kB) Citations (5)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm12374
Abstract: The problem of representing Boolean functions by two-pole contact circuits that are irredundant and admit short fault detection or diagnostic tests of closures of at most $k$ contacts for a given positive integer $k$ is considered. The following assertions are proved: for almost every Boolean function of $n$ variables, the minimal length of a fault detection (diagnostic) test is equal to $2$ (does not exceed $2k+2$, respectively).
Keywords: contact circuit, contact closure, fault detection test, diagnostic test.
Funding agency Grant number
Russian Science Foundation 19-71-30004
This work was supported by the Russian Science Foundation under grant 19-71-30004.
Received: 10.03.2019
Revised: 23.07.2019
English version:
Mathematical Notes, 2020, Volume 107, Issue 4, Pages 653–662
DOI: https://doi.org/10.1134/S0001434620030323
Bibliographic databases:
Document Type: Article
UDC: 519.718.7
Language: Russian
Citation: K. A. Popkov, “Short Tests of Closures for Contact Circuits”, Mat. Zametki, 107:4 (2020), 591–603; Math. Notes, 107:4 (2020), 653–662
Citation in format AMSBIB
\Bibitem{Pop20}
\by K.~A.~Popkov
\paper Short Tests of Closures for Contact Circuits
\jour Mat. Zametki
\yr 2020
\vol 107
\issue 4
\pages 591--603
\mathnet{http://mi.mathnet.ru/mzm12374}
\crossref{https://doi.org/10.4213/mzm12374}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4081963}
\elib{https://elibrary.ru/item.asp?id=43303243}
\transl
\jour Math. Notes
\yr 2020
\vol 107
\issue 4
\pages 653--662
\crossref{https://doi.org/10.1134/S0001434620030323}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000528213700032}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85083770044}
Linking options:
  • https://www.mathnet.ru/eng/mzm12374
  • https://doi.org/10.4213/mzm12374
  • https://www.mathnet.ru/eng/mzm/v107/i4/p591
    • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:263
    Full-text PDF :52
    References:31
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024