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)* d) None of the above

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

Answer 1

Answer:

Answer: Accepted Strings: These all strings are the part of the language so should be accepted by regular expression. = {a, b, aaa, aba, aabba, aabbb,………}and all other strings that contain odd length strings

Explanation:

Answer 2

Answer:

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)*