FOR FREE MATERIALS

Question

 

Q. Select the correct regular expression of language which contains at most n lengths strings. Where ∑ = {a, b}.   

 

A. (a + b)n

B. (a + b)n (a + b)*

C. (λ + a + b)n

D. (a + b)(a + b)n

 

Answer:

 

Option D is correctRegular Expression of at most n length string is  RE (λ + a + b)n