InterviewSolution
Saved Bookmarks
| 1. |
Which of the following conversion is not possible (algorithmically)?(a) Regular grammar to CFG(b) NDFA to DFA(c) NDPDA to DPDA(d) NDTM to DTM |
|
Answer» Right choice is (c) NDPDA to DPDA The explanation is: Not every NDPDA has an equivalent deterministic PDA. |
|