Let Σ = {0, 1}. Consider the language A = {w | w has an odd length}. Give a string in the language A that has length at least p.
Given that,
Σ = {0, 1}. Consider the language A = {w | w has an odd length}. Give a string in the language A that has length at least p.
Here different values are possible for p, you have not specified the value so, we will discuss for some possible values.
let's assume p=1.
possible strings are:the language A itself is the ans because it has atleast length 1.
Now let's assume p=3
for that all the strings in the language A with length 1 or 2 will not count but other than that all the strings will count.
[here language A not contain length 2]
therefore ans is: A - {0,1}
Now let's assume for p=5
for that same as above strings with length 1,2,3,4 will be excluded.
[here language A not contain length 2 and 4]
So the ans would be: A - {strings with length 1 and 3}
Get Answers For Free
Most questions answered within 1 hours.