Consider a language L defined over the alphabet Σ = {0, 1} which contains all…
Consider a language L defined over the alphabet Σ = {0, 1} which contains all the strings whose length is at most n. Find the number of equivalence classes of language L.
- A.
n
- B.
n+1
- C.
n+2
- D.
2n
Attempted by 119 students.
Sign up free to check your answer
Sign up freeLoading lesson…