將具有約束條件的邏輯函數(shù)F=Σm(0,2,3,4,6,7,9)化為最簡與或式結(jié)果應(yīng)為()
A.A B.B C.C D.D
函數(shù)F(A,B,C,D)=Σm(0,1,2,4,5,10)+Σd(8,9,12,13,14,15)的最簡與或表達(dá)式為()
能使邏輯函數(shù)為零的變量(順序ABC)組合是()
A.011,110,101 B.010,001,100 C.110,101,011 D.110,101,111