Q. No. 1: Consider = {a , b}. Construct finite automata for each of the following languages (8)

(i) Language of all words which contain odd number of as and any number of bs (if any)

Solution:

(ii) Language of all words that end with double letter

Solution:

(iii) Language of all words that start and end with different letters

Solution:

(iv) Language of all words that do not contain double a in them somewhere