4. Consider alphabet = {0, 1}. (a) Design a finite state machine that accepts all strings...

  

Transcribed Image Text:

4. Consider alphabet = {0, 1}. (a) Design a finite state machine that accepts all strings that end with 01. (b) Design a finite state machine whose language includes only the empty string. 4. Consider alphabet = {0, 1}. (a) Design a finite state machine that accepts all strings that end with 01. (b) Design a finite state machine whose language includes only the empty string.