1. Give a DFA which will accept all strings of length 3n; n =0, 1.2,,,, over...

 

Transcribed Image Text:

1. Give a DFA which will accept all strings of length 3n; n =0, 1.2,,,, over = {a.b}* 2. Draw a DFA accepting the language over {a,b} of all strings that begin or end with aa or bb 3. Draw a DFA accepting the language over {a,b} of all strings in which every a (if there are any) is followed immediately by bb 1. Give a DFA which will accept all strings of length 3n; n =0, 1.2,,,, over = {a.b}* 2. Draw a DFA accepting the language over {a,b} of all strings that begin or end with aa or bb 3. Draw a DFA accepting the language over {a,b} of all strings in which every a (if there are any) is followed immediately by bb