![GATE 2016 [Set-2]](https://solutionsadda.in/wp-content/uploads/2019/05/green-new-logo.png){kind=logo}
Question 8055 – Theory-of-Computation
April 20, 2024Question 3479 – Data-Interpretation
April 20, 2024GATE 2016 [Set-2]
| Question 26 |
The number of states in the minimum sized DFA that accepts the language defined by the regular expression
(0+1)*(0+1)(0+1)*is_________.
| 2 | |
| 3 | |
| 4 | |
| 5 |
Question 26 Explanation:
The regular expression generates the min string “0” or “1” and then any number of 0’s and 1’s .
So, the DFA has two states.
So, the DFA has two states.
Correct Answer: A
Question 26 Explanation:
The regular expression generates the min string “0” or “1” and then any number of 0’s and 1’s .
So, the DFA has two states.
So, the DFA has two states.