Mealy Moore Machine Design Example 1 : Increment a binary number by 1

[@JayPatel-pn7lb]

Easily understood, nice explanation sir

[@samkelo_m_]

Thank you, I had no idea that we are allowed to start from the back

[@ShawAditya]

Great explanation!

[@ex0rrr]

Wonderful lecture! Just a small doubt, in the case of all 1's should we consider MSB as 0?

[@-shoya-ishida-]

thank you

[@unkonw9621]

love it !

[@prashantdubey9984]

Sir we can also draw the mealy m/c using the 2 states .

[@UroosaIftikhar]

Hello sir! all of your vedios are good but i have a question if only input string is given like 101111000011 and the examiner says find the output but we dont have any state stable or state diagram than what's the procedure of finding the output.

[@itskaur6938]

What if there are four one's??

[@Mahanth.]

make ALL 0 left to right imagine MSB as 0 make it 1 => 10000 (16, which is true for 1111[15] + 1(0) ) we always treat 1 trailling zero for SUM, and n trailling zeroes for MUL in for worst case ( and in Registers extra bits are discarded)

[@kunalpatil4245]

take input as 01111 and proceed ,

[@XYZ-w8b]

cause in computer system 2's complement representation is used and when we have binary number like 111 (it is having the value -1) and when we use mealy machine or moore machine will get 000 so it is right which means -1 + 1 = 0 111 (which is -1) + 1 = 000 (which is 0)

[@tusharmahajan-ng2ch]

what if the input is 1 then how the output will be 10?

[@namankatiyarkurmi7599]

what if binary number is 111 by this it is converted to 000 but in realty it should be 1000

[@XYZ-w8b]

cause in computer system 2's complement representation is used and when we have binary number like 111 (it is having the value -1) and when we use mealy machine or moore machine will get 000 so it is right which means -1 + 1 = 0 111 (which is -1) + 1 = 000 (which is 0)

[@XYZ-w8b]

Hope it helps !!