In: Computer Science
Ques.6: Once again using similar assumptions (to question 4)about how the inputs are processed, can you design a FSM that detects (i.e, output Z=1) if the input has an equal number of 0’s and 1’s. Note that the string can be of arbitrary length.
I have uploaded the picture(s) which consists of proper explanation of Finite State Machine(FSM)(Definition) and some limitations of FSM.
I have underlined the main points and added some note points which you may help you to clear your doubts.
Hope You understand it.
If any more Explanation need or doubts please ask !
Thank you! Have Great Day.