Define minterm and the maxterm - canonical form, Computer Engineering

Assignment Help:

Define Minterm and the Maxterm - Canonical Form?

Any Boolean expression perhaps expressed in terms of either minterms or maxterms. The literal is a single variable within a term which may or may not be complemented. For an expression with the N variables, minterms and maxterms are defined as follows:

A minterm is the product of the N distinct literals where each literal occurs exactly once.

A maxterm is the sum of the N distinct literals where each literal occurs exactly once.

For the two-variable expression, the maxterms and minterms are as follows

X

Y

Minterm

Maxterm

0

0

X'.Y'

X+Y

0

1

X'.Y

X+Y'

1

0

X.Y'

X'+Y

1

1

X.Y

X'+Y'

For a three-variable expression, the maxterms and minterms are as follows

X

Y

Z

Minterm

Designation

Maxterm

Designtion

0

0

0

X'.Y'.Z'

m0

X+Y+Z

M0

0

0

1

X'.Y'.Z

m1

X+Y+Z'

M1

0

1

0

X'.Y.Z'

m2

X+Y'+Z

M2

0

1

1

X'.Y.Z

m3

X+Y'+Z'

M3

1

0

0

X.Y'.Z'

m4

X'+Y+Z

M4

1

0

1

X.Y'.Z

m5

X'+Y+Z'

M5

1

1

0

X.Y.Z'

m6

X'+Y'+Z

M6

1

1

1

X.Y.Z

m7

X'+Y'+Z'

M7

 Consider a function F= x'y'z+xy'z'+xyz=m1+m4+m7

If we take the complement of F then F'= (x+y+z')(x'+y+z)(x'+y'+z')=M1.M4.M7

Any Boolean function can be expressed as a product of Maxterms and Sum of Minterms.


Related Discussions:- Define minterm and the maxterm - canonical form

Diffeomorphism, A different smooth structure on R: Show that (U, f) given b...

A different smooth structure on R: Show that (U, f) given by U = R, f : x -> x3, is a local chart of the topological manifold M = R which is not a member of the standard smoo

Define top-down parsing techniques, Define Top-down parsing Techniques ...

Define Top-down parsing Techniques Top-down parsing can be observed as an attempt to find left-most derivations of an input-stream through searching for parse trees using a top

Depth in cutoff search, Depth in Cutoff search: The depth is chosen in...

Depth in Cutoff search: The depth is chosen in advance to certify in which the agent does not capture much more long to choose a move: however, if it has longer, well then we

Re:- exam help, Hello there i have 4 exams of ICT and i am after a tutor wh...

Hello there i have 4 exams of ICT and i am after a tutor who can help me in those 4 subjects. One hour for each subjects will be good for me as i have sample papers ready for all s

Keyboard status word generator, Q.  Write short note on Interfacing Keyboar...

Q.  Write short note on Interfacing Keyboard, giving block diagram. Why do we need to introduce circuitry called Keyboard Status Word Generator?

What are the different between hypertext hypermedia, What are the different...

What are the different between hypertext hypermedia? Hypertext is fundamentally the same like regular text; this can be stored, read or searched and edited along with a signifi

Explain design of adder, Q. Explain Design of adder? Adders play one of...

Q. Explain Design of adder? Adders play one of the most significant roles in binary arithmetic. As a matter of fact fixed point addition is frequently used as a simple measure

Find simplified function f and implement, Q. Find simplified function F and...

Q. Find simplified function F and implement that function using only NAND gates. 1. F(A,B,C) = (A+B) (A'+B+C') (A'+B'+C') 2. F (A,B,C) = A'B'C'+B'CD'+A'BCD'+AB'C' 3. F(X,Y

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd