Question

The language {w| w in {0,1}* and w does not have three consecutive 0′s} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive

Answer 1

Answer on Question#38639 – Math – Other

Using the pumping lemma for regular languages we can write a regular expression for $\{w|w \text{ in } \{0,1\}^* \text{ and } w \text{ does not have three consecutive } 0's\}$. So our language is regular.

Answer: A.