This discussion on 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) al(a b)(a b))* b((a b)(a b)) * d) None of the above? is done on EduRev Study Group by Computer Science Engineering (CSE) Students. The Questions and Answers of 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) al(a b)(a b))* b((a b)(a b)) * d) None of the above? are solved by group of students and teacher of Computer Science Engineering (CSE), which is also the largest student community of Computer Science Engineering (CSE). If the answer is not available please wait for a while and a community member will probably answer this soon. You can study other questions, MCQs, videos and tests for Computer Science Engineering (CSE) on EduRev and even discuss your questions like 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) al(a b)(a b))* b((a b)(a b)) * d) None of the above? over here on EduRev! Apart from being the largest Computer Science Engineering (CSE) community, EduRev has the largest solved Question bank for Computer Science Engineering (CSE).