In the figure given below, a deterministic finite automation M has start state A and accepting state D. Which of the following regular expression denoted the set of all words accepted by M ? 
| A. | 001 |
| B. | 10 * 1 * 0 |
| C. | ( 0 | 1) * 011 |
| D. | 1* 0 * 001 |
Answer : C Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
