Generate the grammar which accepts the strings which contains the alphabets {a,b}, Where every string
starts with 'a'
starts and ends with 'a'
starts and ends with the same symbol
contains atleast two a's
fourth symbol from right end is always a
length of the string is excatlly 3
length of the string is atleast 3
length of the string is less than or equal to 3
length of the string is congruent to 2 mod 3 ( ie the length of the string should be 'n' when divided by 3 the remainder is 2)
a^mb^n, where m + n is even
a^mb^n, where m + n is odd
a^mb^n, where m not equal to n, m,n >=1
Complete the following crossword puzzle with the concepts that you had studied in your first module