Question

Construct finite-state machines that act as recognizers for the input described by producing an output of 1 exactly when the input received to that point matches the description. The input and output alphabet in each case is {0, 1}. a. set of all strings ending with one or more 0s b. set of all strings where the number of 0s is a multiple of 3 c. set of all strings containing at least four 1s