For the given language L =  0 x 1 y  | x>=0 , y>=1 , choose the grammar for the language. Options :S-> XY | Ꜫ , X->0X | Ꜫ , Y->1 Y | 1S-> XY , X->0X | 0 , Y->1 Y | ꜪS-> XY , X->0X | Ꜫ , Y->1 Y | 1None of above mentioned

Which of the following is the corresponding Language to the given DFA? L= {x ϵ {0,1} |x ends in 1 and does not contain substring 10}L= {x ϵ {0, 1} * | x ends in 1 and does not contain substring 01}L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 00}L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 11}

Design a PDA for the language consisting of strings with more 0's than 1's.

Which language accepted by the regular expression (0+1)*0(0+1)*0(0+1)*.Select one:a. The set of all strings containing at least two 0’s.b. The set of all strings that begin and end with either 0 or 1.c. The set of all strings containing at most two 0’s.d. The set of all strings containing the substring 00.

The language generated by the below grammar is the set of ____________.S →→ aSa| bSb| a| b; a)all odd length palindromesb)all palindromesc)strings beginning and ending with the same symbold)all even length palindromes

Given: ∑= {a, b}L= {xϵ∑*|x is a string combination}∑4 represents