1.

Which one of the following languages over the alphabet {0, 1} is described by the regular expression?

A. strings with the substring 00
B. strings with at most two 0’s
C. strings with at least two 0’s
D. strings beginning and ending with either 0 or 1View Answer
Answer» D. strings beginning and ending with either 0 or 1View Answer


Discussion

No Comment Found