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:

in a tabular form distinguish or differentiate between modern day method of communication an ancient method of communication.

Answer 2

Answer:none of this

Explanation:

None of this