Give a context free grammar (CFG) and pushdown automaton (PDA) that accepts the following languages: (10)...

 

Transcribed Image Text:

Give a context free grammar (CFG) and pushdown automaton (PDA) that accepts the following languages: (10) m (i) L (M)= {ab m>n>= 0; (ii) L (M)= (01|i>0} (iii) Language of PALINDROME (iv) The language of strings such that number of a's are equal to number of b's in string Give a context free grammar (CFG) and pushdown automaton (PDA) that accepts the following languages: (10) m (i) L (M)= {ab m>n>= 0; (ii) L (M)= (01|i>0} (iii) Language of PALINDROME (iv) The language of strings such that number of a's are equal to number of b's in string