Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






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


Avtomatika i Telemekhanika, 1980, Issue 4, Pages 190–192 (Mi at7077)  

Notes

On the length of the checking sequence for circuits having a memory

V. A. Kozlovskii

Donetsk
Abstract: Complexity estimates are obtained for checking experiments of systems having a memory with constant faults at their inputs.

Received: 09.04.1979
Document Type: Article
UDC: 681.326.74.06
Language: Russian
Citation: V. A. Kozlovskii, “On the length of the checking sequence for circuits having a memory”, Avtomat. i Telemekh., 1980, no. 4, 190–192
Citation in format AMSBIB
\Bibitem{Koz80}
\by V.~A.~Kozlovskii
\paper On the length of the checking sequence for circuits having a memory
\jour Avtomat. i Telemekh.
\yr 1980
\issue 4
\pages 190--192
\mathnet{http://mi.mathnet.ru/at7077}
Linking options:
  • https://www.mathnet.ru/eng/at7077
  • https://www.mathnet.ru/eng/at/y1980/i4/p190
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:111
    Full-text PDF :42
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024