Scribd Logo
Upload

Welcome to Scribd!

  • A B A B A: Rezolvare

    Uploaded by

    Elias
    5 views2 pages
    1. The document discusses logical relations and identities. It provides examples of verifying logical identities like a b a b = ab and relations like a + a = 1, a + 1 = a, etc. using truth tables. 2. Expressions are written using only NAND or NOR operators, for example (a b) (c d) using only NAND. 3. The identity (a + b)c = a + (bc) is demonstrated using truth tables. Other logical identities are also proven, like a + a b a b.

    Original Description:

    Original Title

    R12-1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document discusses logical relations and identities. It provides examples of verifying logical identities like a b a b = ab and relations like a + a = 1, a + 1 = a, etc. using truth tables. 2. Expressions are written using only NAND or NOR operators, for example (a b) (c d) using only NAND. 3. The identity (a + b)c = a + (bc) is demonstrated using truth tables. Other logical identities are also proven, like a + a b a b.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    5 views2 pages

    A B A B A: Rezolvare

    Uploaded by

    Elias
    1. The document discusses logical relations and identities. It provides examples of verifying logical identities like a b a b = ab and relations like a + a = 1, a + 1 = a, etc. using truth tables. 2. Expressions are written using only NAND or NOR operators, for example (a b) (c d) using only NAND. 3. The identity (a + b)c = a + (bc) is demonstrated using truth tables. Other logical identities are also proven, like a + a b a b.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    RELATII LOGICE

    1. S se verifice identitatea logic : a b a b a

    Rezolvare

    a b a b ( a b) ( a b) a a b a b a (1 b b) a a

    Mai simplu:
    a b a b ab ab a

    2. S se verifice rela iile logice:


    a a 1, a 1 a , a a 0 , a 0 a
    a a 0 , a 1 a , a a 1, a 0 a

    Rezolvare

    a a a a a a a a 1 a 1

    a
    a 1 a 1 a 0 a Vcc a

    a
    0
    a a a a a a 0 0 0

    a
    a
    a 0 a 0 a 1 a

    a 0
    a a a a a a 0 0 0

    a a
    a 1 a 0 a 1 a Vcc

    a
    1
    a a a a a a 1

    a
    a 0 a 1 a 0 a a

    ASDN 101 - 1
    RELATII LOGICE

    3. S se scrie expresia: E ab cd , folosind numai operator NAND.

    Rezolvare
    E ab cd ab cd ab cd ( a b ) (c d ) ( a b ) (c d)

    4. S se scrie expresia: E ( a b ) (c d ) , folosind numai operator NOR.

    Rezolvare
    E ( a b) (c d ) (a b) (c d) a b c d ( a b ) (c d ) ( a b ) (c d)

    5. Demonstra i identitatea: (a b) c a (b c )

    Rezolvare
    Fie: F1 (a b) c , F 2 a (b c )
    a b c a b F1 b c F2
    0 0 0 0 1 1 1 Rezult : F1=F2.
    0 0 1 0 0 0 0
    0 1 0 1 0 0 0
    0 1 1 1 1 1 1
    1 0 0 1 0 1 0
    1 0 1 1 1 0 1
    1 1 0 0 1 0 1
    1 1 1 0 0 1 0

    5. Demonstra i c : a a b a b

    Rezolvare
    Fie: F1 a a b, F 2 a b
    a b a a b F1 F2
    0 0 1 0 0 0 Rezult : F1=F2.
    0 1 1 1 1 1
    1 0 0 0 1 1
    1 1 0 0 1 1

    ASDN 101 - 2

    You might also like