7. Let 1 0 = {0,1}. (a) Draw the diagram of a finite state machine that...

 

Transcribed Image Text:

7. Let 1 0 = {0,1}. (a) Draw the diagram of a finite state machine that recognizes each occurence of 1010 in an element of , including overlaps. (b) Draw the diagram of a finite state machine that recognizes each occurence of 1010 in an element of *, excluding overlaps. (c) Draw the diagram of a finite state machine that recognizes each occurence of 1010 in an element of that ends in a position that is a multiple of 4. 7. Let 1 0 = {0,1}. (a) Draw the diagram of a finite state machine that recognizes each occurence of 1010 in an element of , including overlaps. (b) Draw the diagram of a finite state machine that recognizes each occurence of 1010 in an element of *, excluding overlaps. (c) Draw the diagram of a finite state machine that recognizes each occurence of 1010 in an element of that ends in a position that is a multiple of 4.