MCQOPTIONS
Saved Bookmarks
| 1. |
Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below:a bp - qq r sr r ss r sThe minimum number of states required in Deterministic Finite Automation (DFA) equivalent toNFA is |
| A. | 5 |
| B. | 4 |
| C. | 3 |
| D. | 2 |
| Answer» D. 2 | |