Question

consider the language L={all strings of odd length} over the input {a.b}. which of the following is the correct regular expression for the language L​

Answer 1

Hey buddy here's your answer....

String

StringDefinition − A string is a finite sequence of symbols taken from ∑.

∑.Example − ‘cabcad’ is a valid string on the alphabet set ∑ = {a, b, c, d}..

AND

Length of a String

Length of a StringDefinition − It is the number of symbols present in a string. (Denoted by |S|).

Examples −If S = ‘cabcad’, |S|= 6

You can correct regular expression for the language L...by yourself...please..ok....

Hope it helps u...please mark me as Brainiest......