Which of the following is not possible algorithmically ?
| A. | Regular grammar to context free grammar |
| B. | Non-deterministic FSA to deterministic FSA |
| C. | Non-deterministic PDA to deterministic PDA |
| 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. |
