Question-1:

Create DFAs and Transition Tables for the below languages over alphabet = {a,b}:

1. Language of all words starting and ending with different letters

2. Language of all words containing substring abb

3. Language of all words containing substring abb or baa

4. Language of all words not containing substring abb

5. EVEN-EVEN / ODD-ODD / EVEN-ODD / ODD-EVEN

6. Language of all words with count of a as multiple of three

7. Language of all words with count of a as not multiple of three

8. Language of all words with a as 2nd letter

Question-2:

Chose any three languages and write the code for respective enum and 2-D arrays. [Hint:It will be generated from the resptive transition tables of the laguages.]