Question

Consider the language L={All strings of odd length} over the input alphabet {a, b}.
Which of the following is the correct regular expression for the language L?
a) ((a+b)a(a+b)) * +((a+b)b(a+b)) *
b) a(a +b)* (a+b)*+b(a+b)* (a+b)*
c) a((a+b)(a +b)) * +b((a+b)(a+b)) *
d) None of the above​

Answer 1

Answer:

Consider the language L={All strings of odd length} over the input alphabet {a, b}.

Which of the following is the correct regular expression for the language L?

a) ((a+b)a(a+b)) * +((a+b)b(a+b)) *

b) a(a +b)* (a+b)*+b(a+b)* (a+b)*

c) a((a+b)(a +b)) * +b((a+b)(a+b)) *

d) None of the above