Diagnosis of three types of constant faults in read-once contact networks over finite bases

Monther I. Busbait, Mikhail Moshkov

Research output: Contribution to journalArticlepeer-review

Abstract

We study the depth of decision trees for diagnosis of three types of constant faults in read-once contact networks over finite bases containing only indecomposable networks. For each basis and each type of faults, we obtain a linear upper bound on the minimum depth of decision trees depending on the number of edges in networks. For bases containing networks with at most 10 edges, we find sharp coefficients for linear bounds.
Original languageEnglish (US)
Pages (from-to)26-42
Number of pages17
JournalTheoretical Computer Science
Volume630
DOIs
StatePublished - Mar 24 2016

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Diagnosis of three types of constant faults in read-once contact networks over finite bases'. Together they form a unique fingerprint.

Cite this