Which of the following statements is wrong ?
| A. | The language accepted by finite automata are the languages denoted by regular expressions |
| B. | For every DFA there is a regular expression denoting its language |
| C. | For a regular expression r, there does not exist NFA with L(r) any transit that accept |
| D. | None of these |
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. |
