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
Correct : 4
Similar Questions
Consider the following grammar:
S —> aSb|X
X —>aX|Xb|a|b
What can be said about the language generated by grammar?
Consider the following grammar:
S —> aSb|X
X —>aX|Xb|a|b
What can be said about the language generated by grammar?
Consider the following grammar:
S —> aSb|X
X —>aX|Xb|a|b
What can be said about the language generated by grammar?
Total Unique Visitors
Loading......