Computer Sciences > Gate 2023 > Regular Language
Consider the following language L = {w ∈ {0,1}*| w does not contains three or more
consecutive 1's}. The number of states in minimal DFA that accepts L is
Explanation
Correct : 4
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.