MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
Find the wrong statement? |
| A. | The language accepted by finite automata are the languages denoted by regular expression |
| B. | Every DFA has a regular expression denoting its language |
| C. | For a regular expression r, there does not exists NDFA with L® ant transit that accept |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |