Question

consider the language L={all the stringrs of odd length} over the input alphabet {a,b}. which of the following is the regular expression for the language L ?​

Answer 1

Answer:

Accepted Strings: 

These all strings are the part of the language so should be accepted by regular expression.

Example strings

= {a, b,  aaa, aba, aabba, aabbb,………}and all other strings that contain odd length strings.

Rejected Strings:

These all strings are not part of the language so should be rejected by regular expression.

Example strings

= {aa, bb, ab, ba, aaaa, abba, abbb,……………..} and all other strings that do not contain odd length strings.

R.E = (a+b) (aa+bb+ab+ba)*

Part 1 (a+b)

Part 2 (aa+bb+ab+ba)*