Abstract :
This correspondence is concerned with the study of static hazards in combinational systems by means of ( n, k, i) trees and digraphs [1],[2].
Keywords :
Digraphs, graph theory, minimization, (n, k, i) tree, static hazard.; Boolean algebra; Boolean functions; Computer science; Graph theory; Hazards; Merging; Minimization; Tree graphs; Digraphs, graph theory, minimization, (n, k, i) tree, static hazard.;
