Question 4 The regular expression given below describes : r=(1+01)* (0+λ) A Set of all string not containing ‘11’ B Set of all string not containing […]

Question 5 Which of the following language is regular : A L = { an bn| n ≥ 1 } B L = { an bm […]

Question 4 Which sentence can be generated by S→d/bA A→d/ccA A bccddd B aabccd C ababccd D abbbd E None of the above Theory-of-ComputationLanguages-and-Grammars Question 4 […]

Question 4 Let L be a regular language and M be a context-free language, both over the alphabet Σ. Let Lc and Mc denote the complements […]